/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 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-07 01:26:45,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-07 01:26:45,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-07 01:26:45,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-07 01:26:45,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-07 01:26:45,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-07 01:26:45,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-07 01:26:45,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-07 01:26:45,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-07 01:26:45,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-07 01:26:45,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-07 01:26:45,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-07 01:26:45,586 INFO L153 SettingsManager]: * Use SBE=true [2024-04-07 01:26:45,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-07 01:26:45,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-07 01:26:45,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-07 01:26:45,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-07 01:26:45,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-07 01:26:45,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-07 01:26:45,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-07 01:26:45,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-07 01:26:45,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-07 01:26:45,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-07 01:26:45,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-07 01:26:45,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-07 01:26:45,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-07 01:26:45,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-07 01:26:45,590 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-07 01:26:45,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-07 01:26:45,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-07 01:26:45,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-07 01:26:45,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-07 01:26:45,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-07 01:26:45,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-07 01:26:45,591 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-07 01:26:45,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-07 01:26:45,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-07 01:26:45,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-07 01:26:45,591 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-07 01:26:45,591 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 -> 10 [2024-04-07 01:26:45,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-07 01:26:45,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-07 01:26:45,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-07 01:26:45,756 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-07 01:26:45,756 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-07 01:26:45,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl [2024-04-07 01:26:45,757 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl' [2024-04-07 01:26:45,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-07 01:26:45,776 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-07 01:26:45,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-07 01:26:45,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-07 01:26:45,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-07 01:26:45,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,825 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-07 01:26:45,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-07 01:26:45,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-07 01:26:45,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-07 01:26:45,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-07 01:26:45,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-07 01:26:45,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-07 01:26:45,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-07 01:26:45,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-07 01:26:45,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/1) ... [2024-04-07 01:26:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-07 01:26:45,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 01:26:45,913 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-07 01:26:45,934 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-07 01:26:45,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-07 01:26:45,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-07 01:26:45,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-07 01:26:45,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-07 01:26:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-07 01:26:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-07 01:26:45,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-07 01:26:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-07 01:26:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-07 01:26:45,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-07 01:26:45,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-07 01:26:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-07 01:26:45,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-07 01:26:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-07 01:26:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-07 01:26:45,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2024-04-07 01:26:45,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-04-07 01:26:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-04-07 01:26:45,969 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-07 01:26:46,007 INFO L241 CfgBuilder]: Building ICFG [2024-04-07 01:26:46,009 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-07 01:26:46,153 INFO L282 CfgBuilder]: Performing block encoding [2024-04-07 01:26:46,162 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-07 01:26:46,162 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-07 01:26:46,163 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:26:46 BoogieIcfgContainer [2024-04-07 01:26:46,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-07 01:26:46,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-07 01:26:46,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-07 01:26:46,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-07 01:26:46,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 01:26:45" (1/2) ... [2024-04-07 01:26:46,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db4408b and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:26:46, skipping insertion in model container [2024-04-07 01:26:46,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:26:46" (2/2) ... [2024-04-07 01:26:46,175 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2024-04-07 01:26:46,181 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-07 01:26:46,189 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-07 01:26:46,189 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-07 01:26:46,189 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-07 01:26:46,230 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-07 01:26:46,264 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-07 01:26:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-07 01:26:46,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 01:26:46,267 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-07 01:26:46,268 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-07 01:26:46,399 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-07 01:26:46,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:26:46,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-07 01:26:46,428 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;@61658a7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-07 01:26:46,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-07 01:26:46,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 01:26:46,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:26:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2024-04-07 01:26:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 01:26:46,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281527988] [2024-04-07 01:26:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:46,831 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-07 01:26:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 01:26:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281527988] [2024-04-07 01:26:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281527988] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 01:26:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 01:26:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-07 01:26:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704700180] [2024-04-07 01:26:46,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 01:26:46,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 01:26:46,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 01:26:46,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 01:26:46,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-07 01:26:46,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:46,867 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 01:26:46,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-07 01:26:46,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:47,842 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:47,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash -88519838, now seen corresponding path program 1 times [2024-04-07 01:26:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:47,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:48,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:48,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 01:26:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1754367502, now seen corresponding path program 2 times [2024-04-07 01:26:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-07 01:26:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-07 01:26:48,637 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:48,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:26:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1349900014, now seen corresponding path program 3 times [2024-04-07 01:26:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-07 01:26:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-07 01:26:49,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:26:49,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-04-07 01:26:49,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 01:26:49,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:26:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2024-04-07 01:26:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 01:26:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083808418] [2024-04-07 01:26:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-07 01:26:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 01:26:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083808418] [2024-04-07 01:26:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083808418] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 01:26:49,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 01:26:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-07 01:26:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429225121] [2024-04-07 01:26:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 01:26:49,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-07 01:26:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 01:26:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 01:26:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-07 01:26:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:49,894 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 01:26:49,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 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-07 01:26:49,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:26:49,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:50,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:50,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 01:26:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash 177739434, now seen corresponding path program 1 times [2024-04-07 01:26:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:26:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:50,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:26:50,733 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:50,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:26:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 1 times [2024-04-07 01:26:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:50,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:26:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:26:51,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable9 [2024-04-07 01:26:51,371 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 01:26:51,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:26:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2024-04-07 01:26:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 01:26:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616231147] [2024-04-07 01:26:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 01:26:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 01:26:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616231147] [2024-04-07 01:26:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616231147] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 01:26:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 01:26:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 01:26:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586829179] [2024-04-07 01:26:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 01:26:51,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 01:26:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 01:26:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 01:26:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 01:26:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:51,399 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 01:26:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-07 01:26:51,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:26:51,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:26:51,399 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:51,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1754367502, now seen corresponding path program 4 times [2024-04-07 01:26:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:51,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:51,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:51,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:51,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1135432791, now seen corresponding path program 5 times [2024-04-07 01:26:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:52,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:52,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:52,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:26:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1349900014, now seen corresponding path program 6 times [2024-04-07 01:26:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:52,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:52,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:52,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash 177739434, now seen corresponding path program 2 times [2024-04-07 01:26:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:52,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:26:52,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:26:52,692 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:52,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:26:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 2 times [2024-04-07 01:26:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:52,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:26:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:26:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:26:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-04-07 01:26:53,245 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 01:26:53,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:26:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2024-04-07 01:26:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 01:26:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81216884] [2024-04-07 01:26:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:26:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 01:26:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81216884] [2024-04-07 01:26:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81216884] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 01:26:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 01:26:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 01:26:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487010087] [2024-04-07 01:26:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 01:26:53,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 01:26:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 01:26:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 01:26:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 01:26:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:53,295 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 01:26:53,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-07 01:26:53,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:26:53,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:26:53,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:26:53,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:26:53,742 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:53,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 01:26:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash 843063091, now seen corresponding path program 7 times [2024-04-07 01:26:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:53,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:53,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:53,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1799323947, now seen corresponding path program 8 times [2024-04-07 01:26:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:54,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:54,298 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:54,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:26:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 948455977, now seen corresponding path program 9 times [2024-04-07 01:26:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:54,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:54,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:54,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1347489295, now seen corresponding path program 10 times [2024-04-07 01:26:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:56,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:57,207 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:57,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:26:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1069066912, now seen corresponding path program 1 times [2024-04-07 01:26:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:59,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:26:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:26:59,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:59,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-07 01:26:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1392823293, now seen corresponding path program 1 times [2024-04-07 01:26:59,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:59,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:59,506 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-07 01:26:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:26:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:26:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:26:59,522 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-07 01:26:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 01:26:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-04-07 01:26:59,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:26:59,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:27:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -353261903, now seen corresponding path program 1 times [2024-04-07 01:27:00,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:00,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:00,802 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:00,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 01:27:01,015 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:01,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:27:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1218664042, now seen corresponding path program 1 times [2024-04-07 01:27:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:01,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:27:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:01,175 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:01,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:27:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1069066912, now seen corresponding path program 2 times [2024-04-07 01:27:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:03,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:27:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:03,462 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:03,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:27:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 421223438, now seen corresponding path program 1 times [2024-04-07 01:27:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:05,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:05,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:27:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:05,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:05,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:27:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 876201912, now seen corresponding path program 3 times [2024-04-07 01:27:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:07,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:27:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:07,914 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 01:27:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1392455610, now seen corresponding path program 2 times [2024-04-07 01:27:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:09,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:27:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:10,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:10,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 01:27:10,276 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:27:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 3 times [2024-04-07 01:27:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:10,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 01:27:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 01:27:10,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-07 01:27:10,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-04-07 01:27:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:27:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:11,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:11,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28 [2024-04-07 01:27:11,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 01:27:11,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:27:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2024-04-07 01:27:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 01:27:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978271350] [2024-04-07 01:27:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 01:27:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978271350] [2024-04-07 01:27:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978271350] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 01:27:11,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 01:27:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 01:27:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520494537] [2024-04-07 01:27:11,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 01:27:11,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 01:27:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 01:27:11,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 01:27:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 01:27:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:27:11,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 01:27:11,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-07 01:27:11,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:27:11,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:11,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:11,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:11,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:27:11,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:11,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:27:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2109097061, now seen corresponding path program 11 times [2024-04-07 01:27:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-07 01:27:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-07 01:27:12,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:12,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:27:12,296 INFO L85 PathProgramCache]: Analyzing trace with hash -353261903, now seen corresponding path program 2 times [2024-04-07 01:27:12,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:12,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:12,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:12,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 01:27:12,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 01:27:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:27:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:13,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37 [2024-04-07 01:27:13,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 01:27:13,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 01:27:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2024-04-07 01:27:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 01:27:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891313061] [2024-04-07 01:27:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 01:27:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:13,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 01:27:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891313061] [2024-04-07 01:27:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891313061] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 01:27:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012231895] [2024-04-07 01:27:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 01:27:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 01:27:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 01:27:13,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-07 01:27:13,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-07 01:27:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 01:27:13,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-07 01:27:13,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 01:27:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-07 01:27:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:14,051 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 01:27:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 01:27:14,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012231895] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 01:27:14,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 01:27:14,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-07 01:27:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327732643] [2024-04-07 01:27:14,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 01:27:14,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-07 01:27:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 01:27:14,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-07 01:27:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-07 01:27:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:27:14,224 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 01:27:14,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 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-07 01:27:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 01:27:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 01:27:14,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 01:27:18,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-07 01:27:19,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-04-07 01:27:19,152 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@1174d0ca at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-07 01:27:19,163 INFO L158 Benchmark]: Toolchain (without parser) took 33387.62ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 101.1MB in the beginning and 452.4MB in the end (delta: -351.3MB). Peak memory consumption was 702.7MB. Max. memory is 8.0GB. [2024-04-07 01:27:19,164 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-07 01:27:19,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.29ms. Allocated memory is still 151.0MB. Free memory was 101.1MB in the beginning and 121.7MB in the end (delta: -20.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-07 01:27:19,164 INFO L158 Benchmark]: Boogie Preprocessor took 25.18ms. Allocated memory is still 151.0MB. Free memory was 121.6MB in the beginning and 120.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-04-07 01:27:19,164 INFO L158 Benchmark]: RCFGBuilder took 308.88ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 109.6MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-07 01:27:19,164 INFO L158 Benchmark]: TraceAbstraction took 32998.09ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 108.5MB in the beginning and 452.4MB in the end (delta: -344.0MB). Peak memory consumption was 711.2MB. Max. memory is 8.0GB. [2024-04-07 01:27:19,165 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.09ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.29ms. Allocated memory is still 151.0MB. Free memory was 101.1MB in the beginning and 121.7MB in the end (delta: -20.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.18ms. Allocated memory is still 151.0MB. Free memory was 121.6MB in the beginning and 120.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 308.88ms. Allocated memory is still 151.0MB. Free memory was 120.4MB in the beginning and 109.6MB in the end (delta: 10.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32998.09ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 108.5MB in the beginning and 452.4MB in the end (delta: -344.0MB). Peak memory consumption was 711.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@1174d0ca de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@1174d0ca: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-07 01:27:19,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-04-07 01:27:19,423 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...