/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 07:55:21,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 07:55:21,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 07:55:21,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 07:55:21,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 07:55:21,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 07:55:21,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 07:55:21,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 07:55:21,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 07:55:21,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 07:55:21,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 07:55:21,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 07:55:21,997 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 07:55:21,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 07:55:21,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 07:55:21,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 07:55:21,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 07:55:21,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 07:55:21,999 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 07:55:22,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-04-25 07:55:22,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 07:55:22,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 07:55:22,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 07:55:22,202 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 07:55:22,204 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 07:55:22,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl [2025-04-25 07:55:22,205 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-max.wvr.bpl' [2025-04-25 07:55:22,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 07:55:22,227 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 07:55:22,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 07:55:22,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 07:55:22,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 07:55:22,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,257 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 07:55:22,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 07:55:22,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 07:55:22,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 07:55:22,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 07:55:22,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 07:55:22,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 07:55:22,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 07:55:22,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 07:55:22,291 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/1) ... [2025-04-25 07:55:22,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 07:55:22,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 07:55:22,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 07:55:22,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 07:55:22,334 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 07:55:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 07:55:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 07:55:22,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 07:55:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 07:55:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 07:55:22,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 07:55:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 07:55:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 07:55:22,335 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-25 07:55:22,335 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 07:55:22,335 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 07:55:22,336 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 07:55:22,377 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 07:55:22,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 07:55:22,456 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 07:55:22,456 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 07:55:22,477 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 07:55:22,477 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 07:55:22,477 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 07:55:22 BoogieIcfgContainer [2025-04-25 07:55:22,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 07:55:22,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 07:55:22,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 07:55:22,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 07:55:22,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 07:55:22" (1/2) ... [2025-04-25 07:55:22,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22360439 and model type three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 07:55:22, skipping insertion in model container [2025-04-25 07:55:22,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 07:55:22" (2/2) ... [2025-04-25 07:55:22,484 INFO L128 eAbstractionObserver]: Analyzing ICFG three-array-max.wvr.bpl [2025-04-25 07:55:22,493 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 07:55:22,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG three-array-max.wvr.bpl that has 4 procedures, 29 locations, 29 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-25 07:55:22,495 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 07:55:22,535 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 07:55:22,568 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 07:55:22,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 07:55:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 07:55:22,572 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) [2025-04-25 07:55:22,574 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 [2025-04-25 07:55:22,615 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 07:55:22,623 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 07:55:22,628 INFO L340 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, 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;@1dba8783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 07:55:22,628 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 07:55:22,690 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:22,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:22,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1509187016, now seen corresponding path program 1 times [2025-04-25 07:55:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:22,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96090336] [2025-04-25 07:55:22,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 07:55:22,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:22,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-25 07:55:22,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-25 07:55:22,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 07:55:22,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:22,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:22,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96090336] [2025-04-25 07:55:22,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96090336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 07:55:22,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 07:55:22,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 07:55:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649425853] [2025-04-25 07:55:22,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 07:55:22,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 07:55:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:22,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 07:55:22,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 07:55:22,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:22,911 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:22,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2025-04-25 07:55:22,911 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:22,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:22,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 07:55:22,956 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:22,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1437350148, now seen corresponding path program 1 times [2025-04-25 07:55:22,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:22,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13497655] [2025-04-25 07:55:22,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 07:55:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 07:55:22,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 07:55:22,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 07:55:22,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:23,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13497655] [2025-04-25 07:55:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13497655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 07:55:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 07:55:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 07:55:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101901411] [2025-04-25 07:55:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 07:55:23,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 07:55:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:23,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 07:55:23,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 07:55:23,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:23,043 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:23,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2025-04-25 07:55:23,043 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:23,043 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:23,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:23,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:23,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 07:55:23,145 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:23,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash 764714396, now seen corresponding path program 1 times [2025-04-25 07:55:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:23,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193369825] [2025-04-25 07:55:23,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 07:55:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:23,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 07:55:23,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 07:55:23,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 07:55:23,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:23,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193369825] [2025-04-25 07:55:23,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193369825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 07:55:23,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 07:55:23,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 07:55:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968563779] [2025-04-25 07:55:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 07:55:23,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 07:55:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:23,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 07:55:23,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 07:55:23,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:23,231 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:23,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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) [2025-04-25 07:55:23,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:23,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:23,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:23,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:23,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:23,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:23,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 07:55:23,318 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:23,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 412588638, now seen corresponding path program 1 times [2025-04-25 07:55:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:23,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849951510] [2025-04-25 07:55:23,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 07:55:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:23,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 07:55:23,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 07:55:23,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 07:55:23,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:23,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:23,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:23,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849951510] [2025-04-25 07:55:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849951510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 07:55:23,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301080714] [2025-04-25 07:55:23,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 07:55:23,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 07:55:23,970 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) [2025-04-25 07:55:23,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 07:55:23,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 07:55:24,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 07:55:24,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 07:55:24,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:24,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-25 07:55:24,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 07:55:24,379 INFO L354 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 0 case distinctions, treesize of input 51 treesize of output 35 [2025-04-25 07:55:24,385 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 07:55:24,388 INFO L354 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 0 case distinctions, treesize of input 76 treesize of output 52 [2025-04-25 07:55:24,490 INFO L354 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 53 treesize of output 41 [2025-04-25 07:55:24,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:24,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 07:55:24,584 INFO L354 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 91 treesize of output 85 [2025-04-25 07:55:25,302 INFO L325 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-04-25 07:55:25,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 60 [2025-04-25 07:55:25,356 INFO L325 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-04-25 07:55:25,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 1 [2025-04-25 07:55:25,367 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 07:55:25,368 INFO L354 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 0 case distinctions, treesize of input 9 treesize of output 5 [2025-04-25 07:55:25,374 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-25 07:55:25,374 INFO L354 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 53 treesize of output 1 [2025-04-25 07:55:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:25,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301080714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 07:55:25,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 07:55:25,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-25 07:55:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200631060] [2025-04-25 07:55:25,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 07:55:25,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-25 07:55:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:25,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-25 07:55:25,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-04-25 07:55:25,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:25,422 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:25,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 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) [2025-04-25 07:55:25,422 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:25,422 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:25,422 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:25,422 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:25,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:25,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:25,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:25,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:25,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 07:55:25,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:25,917 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:25,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1616591526, now seen corresponding path program 2 times [2025-04-25 07:55:25,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:25,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675479773] [2025-04-25 07:55:25,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 07:55:25,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:25,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-25 07:55:25,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 07:55:25,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 07:55:25,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:25,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675479773] [2025-04-25 07:55:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675479773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 07:55:25,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841321940] [2025-04-25 07:55:25,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 07:55:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 07:55:25,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 07:55:25,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 07:55:25,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-25 07:55:25,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 07:55:25,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 07:55:25,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:25,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 07:55:25,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 07:55:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 07:55:26,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 07:55:26,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841321940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 07:55:26,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 07:55:26,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-04-25 07:55:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808708354] [2025-04-25 07:55:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 07:55:26,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 07:55:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:26,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 07:55:26,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-25 07:55:26,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:26,011 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:26,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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) [2025-04-25 07:55:26,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:26,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:26,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:26,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 07:55:26,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:26,274 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:26,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:26,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2139999942, now seen corresponding path program 3 times [2025-04-25 07:55:26,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:26,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159436259] [2025-04-25 07:55:26,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 07:55:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:26,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-25 07:55:26,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 07:55:26,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 07:55:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:26,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:26,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159436259] [2025-04-25 07:55:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159436259] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 07:55:26,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838584163] [2025-04-25 07:55:26,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 07:55:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 07:55:26,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 07:55:26,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 07:55:26,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-25 07:55:26,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 07:55:26,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 07:55:26,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:26,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 07:55:26,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 07:55:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 07:55:26,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 07:55:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 07:55:26,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838584163] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 07:55:26,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 07:55:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-04-25 07:55:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762679193] [2025-04-25 07:55:26,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 07:55:26,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 07:55:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:26,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 07:55:26,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-25 07:55:26,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:26,413 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:26,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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) [2025-04-25 07:55:26,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:26,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:26,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:26,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:26,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:26,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 07:55:26,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-25 07:55:26,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:26,682 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:26,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -787928824, now seen corresponding path program 4 times [2025-04-25 07:55:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:26,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390598586] [2025-04-25 07:55:26,682 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 07:55:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:26,685 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-25 07:55:26,706 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-25 07:55:26,706 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 07:55:26,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:27,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 07:55:27,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390598586] [2025-04-25 07:55:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390598586] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 07:55:27,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424290906] [2025-04-25 07:55:27,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 07:55:27,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 07:55:27,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 07:55:27,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 07:55:27,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 07:55:27,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-25 07:55:27,964 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-25 07:55:27,964 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 07:55:27,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 07:55:27,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-25 07:55:27,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 07:55:28,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-04-25 07:55:28,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 99 [2025-04-25 07:55:28,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 146 [2025-04-25 07:55:28,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2025-04-25 07:55:29,054 INFO L354 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 0 case distinctions, treesize of input 65 treesize of output 49 [2025-04-25 07:55:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:29,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 07:55:30,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 07:55:30,145 INFO L354 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 871 treesize of output 833 [2025-04-25 07:55:30,424 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 07:55:30,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 07:55:30,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-25 07:55:35,594 INFO L325 Elim1Store]: treesize reduction 5, result has 93.2 percent of original size [2025-04-25 07:55:35,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 853 treesize of output 652 [2025-04-25 07:55:39,357 INFO L325 Elim1Store]: treesize reduction 14, result has 80.8 percent of original size [2025-04-25 07:55:39,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 879 treesize of output 653 [2025-04-25 07:55:40,476 INFO L325 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-04-25 07:55:40,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2025-04-25 07:55:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 07:55:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424290906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 07:55:40,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 07:55:40,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 32 [2025-04-25 07:55:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222855228] [2025-04-25 07:55:40,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 07:55:40,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-25 07:55:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 07:55:40,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-25 07:55:40,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2025-04-25 07:55:40,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:40,510 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 07:55:40,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.5454545454545454) internal successors, (84), 32 states have internal predecessors, (84), 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) [2025-04-25 07:55:40,510 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:40,510 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:40,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:40,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:40,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:40,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 07:55:40,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 07:55:42,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-25 07:55:42,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-25 07:55:42,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-25 07:55:42,993 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 07:55:42,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 07:55:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash -918993848, now seen corresponding path program 5 times [2025-04-25 07:55:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 07:55:42,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969970054] [2025-04-25 07:55:42,993 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 07:55:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 07:55:42,997 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 5 equivalence classes. [2025-04-25 07:55:43,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 07:55:43,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-25 07:55:43,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2025-04-25 08:09:57,093 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2025-04-25 08:09:57,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-25 08:09:57,094 WARN L610 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-14-4-10-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-67-10-10-11-11-11-11-10-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-10-9-9-9-9-9-9-9-9-9-9-8-9-7-9-7-9-7-9-7-9-7-9-7-9-6-9-6-9-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 context. [2025-04-25 08:09:57,095 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-25 08:09:57,095 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-25 08:09:57,095 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-25 08:09:57,100 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-04-25 08:09:57,103 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 08:09:57,103 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 08:09:57,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 08:09:57,113 INFO L201 PluginConnector]: Adding new model three-array-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 08:09:57 BasicIcfg [2025-04-25 08:09:57,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 08:09:57,114 INFO L158 Benchmark]: Toolchain (without parser) took 874886.48ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 98.9MB in the beginning and 1.0GB in the end (delta: -933.2MB). Peak memory consumption was 814.2MB. Max. memory is 16.0GB. [2025-04-25 08:09:57,114 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 08:09:57,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.30ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 96.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 08:09:57,114 INFO L158 Benchmark]: Boogie Preprocessor took 30.58ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 08:09:57,114 INFO L158 Benchmark]: RCFGBuilder took 188.11ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 85.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 08:09:57,115 INFO L158 Benchmark]: TraceAbstraction took 874633.97ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.3MB in the beginning and 1.0GB in the end (delta: -946.8MB). Peak memory consumption was 805.8MB. Max. memory is 16.0GB. [2025-04-25 08:09:57,115 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.17ms. Allocated memory is still 167.8MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.30ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 96.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 30.58ms. Allocated memory is still 167.8MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 188.11ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 85.3MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 874633.97ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 85.3MB in the beginning and 1.0GB in the end (delta: -946.8MB). Peak memory consumption was 805.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2595, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 548, dependent conditional: 545, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 0, independent unconditional: 2047, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 0, independent unconditional: 2047, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 404, independent: 401, independent conditional: 0, independent unconditional: 401, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 404, independent: 399, independent conditional: 0, independent unconditional: 399, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2050, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 404, unknown conditional: 0, unknown unconditional: 404] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 401, Positive conditional cache size: 0, Positive unconditional cache size: 401, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1614, Maximal queried relation: 0, Independence queries for same thread: 545, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 60, Number of trivial persistent sets: 31, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 436, independent: 433, independent conditional: 0, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2595, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 548, dependent conditional: 545, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 1614, independent unconditional: 433, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 0, independent unconditional: 2047, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2050, independent: 2047, independent conditional: 0, independent unconditional: 2047, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 404, independent: 401, independent conditional: 0, independent unconditional: 401, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 404, independent: 399, independent conditional: 0, independent unconditional: 399, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2050, independent: 1646, independent conditional: 0, independent unconditional: 1646, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 404, unknown conditional: 0, unknown unconditional: 404] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 401, Positive conditional cache size: 0, Positive unconditional cache size: 401, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1614, Maximal queried relation: 0, Independence queries for same thread: 545 - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-14-4-10-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-67-10-10-11-11-11-11-10-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-10-9-9-9-9-9-9-9-9-9-9-8-9-7-9-7-9-7-9-7-9-7-9-7-9-6-9-6-9-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-14-4-10-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-67-10-10-11-11-11-11-10-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-10-9-9-9-9-9-9-9-9-9-9-8-9-7-9-7-9-7-9-7-9-7-9-7-9-6-9-6-9-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 context. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-14-4-10-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-67-10-10-11-11-11-11-10-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-10-9-9-9-9-9-9-9-9-9-9-8-9-7-9-7-9-7-9-7-9-7-9-7-9-6-9-6-9-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 48 with TraceHistMax 4,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-7-2-14-4-10-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-11-4-10-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-9-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-8-4-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-67-10-10-11-11-11-11-10-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-11-9-10-9-9-9-9-9-9-9-9-9-9-8-9-7-9-7-9-7-9-7-9-7-9-7-9-6-9-6-9-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-8-5-7-4-6-4-5-4-5-4-5-4-5-4-5-4-5-4-5-3-5-3-4-3-3-3-3-3-3-3-3-3-3-3-3-2-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 45 locations, 52 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 874.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 3.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 379 ConstructedInterpolants, 7 QuantifiedInterpolants, 17631 SizeOfPredicates, 21 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 6/44 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown