/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.2.4-wip.dk.conditional-comm-faa7b7a-m
[2024-04-28 11:58:34,799 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-04-28 11:58:34,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf
[2024-04-28 11:58:34,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-04-28 11:58:34,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-04-28 11:58:34,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-04-28 11:58:34,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-04-28 11:58:34,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-04-28 11:58:34,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-04-28 11:58:34,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-04-28 11:58:34,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-04-28 11:58:34,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-04-28 11:58:34,904 INFO L153 SettingsManager]: * Use SBE=true
[2024-04-28 11:58:34,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-04-28 11:58:34,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-04-28 11:58:34,909 INFO L153 SettingsManager]: * sizeof long=4
[2024-04-28 11:58:34,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-04-28 11:58:34,909 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-04-28 11:58:34,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-04-28 11:58:34,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-04-28 11:58:34,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-04-28 11:58:34,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-04-28 11:58:34,910 INFO L153 SettingsManager]: * sizeof long double=12
[2024-04-28 11:58:34,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-04-28 11:58:34,911 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-04-28 11:58:34,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-04-28 11:58:34,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-04-28 11:58:34,911 INFO L153 SettingsManager]: * To the following directory=./dump/
[2024-04-28 11:58:34,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-04-28 11:58:34,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-04-28 11:58:34,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-04-28 11:58:34,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-04-28 11:58:34,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-04-28 11:58:34,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10
[2024-04-28 11:58:35,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-04-28 11:58:35,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-04-28 11:58:35,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-04-28 11:58:35,189 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser...
[2024-04-28 11:58:35,189 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized
[2024-04-28 11:58:35,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl
[2024-04-28 11:58:35,191 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl'
[2024-04-28 11:58:35,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-04-28 11:58:35,222 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements.
[2024-04-28 11:58:35,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-04-28 11:58:35,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-04-28 11:58:35,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-04-28 11:58:35,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,273 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2024-04-28 11:58:35,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-04-28 11:58:35,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-04-28 11:58:35,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-04-28 11:58:35,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-04-28 11:58:35,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-04-28 11:58:35,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-04-28 11:58:35,291 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-04-28 11:58:35,291 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-04-28 11:58:35,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/1) ...
[2024-04-28 11:58:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-04-28 11:58:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:58:35,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-04-28 11:58:35,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-04-28 11:58:35,369 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration
[2024-04-28 11:58:35,370 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2024-04-28 11:58:35,370 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2024-04-28 11:58:35,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration
[2024-04-28 11:58:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2024-04-28 11:58:35,371 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2024-04-28 11:58:35,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2024-04-28 11:58:35,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-04-28 11:58:35,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-04-28 11:58:35,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration
[2024-04-28 11:58:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2024-04-28 11:58:35,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2024-04-28 11:58:35,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration
[2024-04-28 11:58:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread4
[2024-04-28 11:58:35,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4
[2024-04-28 11:58:35,374 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-04-28 11:58:35,420 INFO L241 CfgBuilder]: Building ICFG
[2024-04-28 11:58:35,421 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-04-28 11:58:35,565 INFO L282 CfgBuilder]: Performing block encoding
[2024-04-28 11:58:35,586 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-04-28 11:58:35,587 INFO L309 CfgBuilder]: Removed 0 assume(true) statements.
[2024-04-28 11:58:35,588 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:58:35 BoogieIcfgContainer
[2024-04-28 11:58:35,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-04-28 11:58:35,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-04-28 11:58:35,591 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-04-28 11:58:35,605 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-04-28 11:58:35,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.04 11:58:35" (1/2) ...
[2024-04-28 11:58:35,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b65571c and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:58:35, skipping insertion in model container
[2024-04-28 11:58:35,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:58:35" (2/2) ...
[2024-04-28 11:58:35,607 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-dec.wvr.bpl
[2024-04-28 11:58:35,614 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-04-28 11:58:35,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-04-28 11:58:35,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-04-28 11:58:35,625 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-04-28 11:58:35,672 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-04-28 11:58:35,706 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-04-28 11:58:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-04-28 11:58:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:58:35,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-04-28 11:58:35,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-04-28 11:58:35,749 INFO L187 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-04-28 11:58:35,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:58:35,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-04-28 11:58:35,769 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5dbcdc44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213, mConComCheckerConditionCriterion=false
[2024-04-28 11:58:35,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-04-28 11:58:35,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:58:35,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:58:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 819098785, now seen corresponding path program 1 times
[2024-04-28 11:58:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:58:35,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146749463]
[2024-04-28 11:58:35,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:58:36,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146749463]
[2024-04-28 11:58:36,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146749463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 11:58:36,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 11:58:36,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-04-28 11:58:36,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560130582]
[2024-04-28 11:58:36,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 11:58:36,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-04-28 11:58:36,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:58:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-04-28 11:58:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-04-28 11:58:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:36,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:58:36,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:58:36,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:36,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:36,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1899804125, now seen corresponding path program 1 times
[2024-04-28 11:58:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:36,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:37,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:37,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2079012676, now seen corresponding path program 1 times
[2024-04-28 11:58:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:37,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:58:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:37,518 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:37,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1929356797, now seen corresponding path program 1 times
[2024-04-28 11:58:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:37,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:37,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:58:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:37,750 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:37,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24
[2024-04-28 11:58:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1313810191, now seen corresponding path program 2 times
[2024-04-28 11:58:37,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:37,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:38,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:38,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38
[2024-04-28 11:58:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -319837050, now seen corresponding path program 1 times
[2024-04-28 11:58:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:40,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:40,523 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:40,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35
[2024-04-28 11:58:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1325013875, now seen corresponding path program 1 times
[2024-04-28 11:58:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:40,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:40,835 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size
[2024-04-28 11:58:40,836 INFO L378 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 29 treesize of output 33
[2024-04-28 11:58:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1753320299, now seen corresponding path program 1 times
[2024-04-28 11:58:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:40,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-04-28 11:58:40,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-04-28 11:58:41,172 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size
[2024-04-28 11:58:41,173 INFO L378 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 34 treesize of output 36
[2024-04-28 11:58:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1239952760, now seen corresponding path program 1 times
[2024-04-28 11:58:41,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-04-28 11:58:41,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2024-04-28 11:58:41,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:41,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1313990917, now seen corresponding path program 3 times
[2024-04-28 11:58:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:41,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:58:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:41,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:41,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35
[2024-04-28 11:58:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2079012675, now seen corresponding path program 4 times
[2024-04-28 11:58:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:43,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:44,068 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:44,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35
[2024-04-28 11:58:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1313810191, now seen corresponding path program 5 times
[2024-04-28 11:58:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:44,352 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:44,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1316426649, now seen corresponding path program 1 times
[2024-04-28 11:58:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:44,617 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size
[2024-04-28 11:58:44,618 INFO L378 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 29 treesize of output 33
[2024-04-28 11:58:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1481676418, now seen corresponding path program 1 times
[2024-04-28 11:58:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:44,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:58:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:44,868 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size
[2024-04-28 11:58:44,868 INFO L378 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 29 treesize of output 33
[2024-04-28 11:58:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1312671209, now seen corresponding path program 1 times
[2024-04-28 11:58:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:44,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:58:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:58:45,073 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size
[2024-04-28 11:58:45,073 INFO L378 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 50 treesize of output 50
[2024-04-28 11:58:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1481676419, now seen corresponding path program 1 times
[2024-04-28 11:58:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:45,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:45,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-04-28 11:58:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2024-04-28 11:58:45,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:45,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 350658571, now seen corresponding path program 2 times
[2024-04-28 11:58:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-04-28 11:58:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-04-28 11:58:47,891 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:47,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38
[2024-04-28 11:58:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2080070856, now seen corresponding path program 1 times
[2024-04-28 11:58:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:48,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:48,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21
[2024-04-28 11:58:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash -319481500, now seen corresponding path program 2 times
[2024-04-28 11:58:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:50,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:50,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:50,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:58:50,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38
[2024-04-28 11:58:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash -475846765, now seen corresponding path program 1 times
[2024-04-28 11:58:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-04-28 11:58:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-04-28 11:58:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:53,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable32,SelfDestructingSolverStorable11,SelfDestructingSolverStorable33,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable0,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28
[2024-04-28 11:58:53,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:58:53,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:58:53,016 INFO L85 PathProgramCache]: Analyzing trace with hash -686254423, now seen corresponding path program 1 times
[2024-04-28 11:58:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:58:53,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19973989]
[2024-04-28 11:58:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:58:53,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:58:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19973989]
[2024-04-28 11:58:53,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19973989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 11:58:53,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 11:58:53,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-04-28 11:58:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113508926]
[2024-04-28 11:58:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 11:58:53,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-04-28 11:58:53,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:58:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-04-28 11:58:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-04-28 11:58:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:53,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:58:53,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:58:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:53,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:53,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-04-28 11:58:53,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:58:53,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:58:53,567 INFO L85 PathProgramCache]: Analyzing trace with hash 53308133, now seen corresponding path program 1 times
[2024-04-28 11:58:53,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:58:53,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139556717]
[2024-04-28 11:58:53,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:53,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:58:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139556717]
[2024-04-28 11:58:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139556717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 11:58:53,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 11:58:53,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-04-28 11:58:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589206132]
[2024-04-28 11:58:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 11:58:53,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-04-28 11:58:53,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:58:53,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-04-28 11:58:53,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-04-28 11:58:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:53,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:58:53,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:58:53,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:53,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:53,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:53,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:53,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-04-28 11:58:53,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:58:53,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:58:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash 215793767, now seen corresponding path program 1 times
[2024-04-28 11:58:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:58:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352287187]
[2024-04-28 11:58:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:54,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:58:54,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352287187]
[2024-04-28 11:58:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352287187] provided 0 perfect and 1 imperfect interpolant sequences
[2024-04-28 11:58:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654519634]
[2024-04-28 11:58:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:54,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:58:54,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:58:54,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-04-28 11:58:54,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-04-28 11:58:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:54,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core
[2024-04-28 11:58:54,180 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-04-28 11:58:54,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-04-28 11:58:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:54,322 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-04-28 11:58:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654519634] provided 0 perfect and 2 imperfect interpolant sequences
[2024-04-28 11:58:54,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-04-28 11:58:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15
[2024-04-28 11:58:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992399684]
[2024-04-28 11:58:54,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-04-28 11:58:54,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-04-28 11:58:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:58:54,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-04-28 11:58:54,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210
[2024-04-28 11:58:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:54,524 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:58:54,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:58:54,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:54,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:54,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:54,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:59,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-04-28 11:58:59,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-04-28 11:58:59,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36
[2024-04-28 11:58:59,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:58:59,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:58:59,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1000235387, now seen corresponding path program 2 times
[2024-04-28 11:58:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:58:59,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995470024]
[2024-04-28 11:58:59,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:58:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:58:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:58:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:58:59,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:58:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995470024]
[2024-04-28 11:58:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995470024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 11:58:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 11:58:59,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-04-28 11:58:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903966104]
[2024-04-28 11:58:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 11:58:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-04-28 11:58:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:58:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-04-28 11:58:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-04-28 11:58:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:58:59,499 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:58:59,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:58:59,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:58:59,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:59,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:58:59,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2024-04-28 11:58:59,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:00,552 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size
[2024-04-28 11:59:00,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 74
[2024-04-28 11:59:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1807120829, now seen corresponding path program 1 times
[2024-04-28 11:59:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:59:00,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:59:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:59:00,826 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size
[2024-04-28 11:59:00,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 74
[2024-04-28 11:59:00,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1476326407, now seen corresponding path program 1 times
[2024-04-28 11:59:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:59:00,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:59:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:59:01,171 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size
[2024-04-28 11:59:01,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 74
[2024-04-28 11:59:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1468875519, now seen corresponding path program 1 times
[2024-04-28 11:59:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-04-28 11:59:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600
[2024-04-28 11:59:02,382 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size
[2024-04-28 11:59:02,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 74
[2024-04-28 11:59:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash 911537102, now seen corresponding path program 1 times
[2024-04-28 11:59:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:59:02,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-04-28 11:59:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-04-28 11:59:02,603 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:59:02,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18
[2024-04-28 11:59:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1398541051, now seen corresponding path program 1 times
[2024-04-28 11:59:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:02,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:02,819 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:59:02,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18
[2024-04-28 11:59:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1478906410, now seen corresponding path program 1 times
[2024-04-28 11:59:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:02,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:59:02,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18
[2024-04-28 11:59:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1398510713, now seen corresponding path program 2 times
[2024-04-28 11:59:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:03,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-04-28 11:59:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18
[2024-04-28 11:59:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 355971133, now seen corresponding path program 2 times
[2024-04-28 11:59:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:03,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:03,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable49,SelfDestructingSolverStorable39
[2024-04-28 11:59:03,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:59:03,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:59:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash -62838377, now seen corresponding path program 1 times
[2024-04-28 11:59:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:59:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392254965]
[2024-04-28 11:59:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-04-28 11:59:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:59:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392254965]
[2024-04-28 11:59:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392254965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-04-28 11:59:03,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-04-28 11:59:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-04-28 11:59:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231660806]
[2024-04-28 11:59:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-04-28 11:59:03,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-04-28 11:59:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:59:03,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-04-28 11:59:03,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-04-28 11:59:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:03,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:59:03,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:59:03,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:03,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:03,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:03,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:03,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:03,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-04-28 11:59:05,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:59:05,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:59:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2121244581, now seen corresponding path program 2 times
[2024-04-28 11:59:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:59:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639689903]
[2024-04-28 11:59:05,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:59:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639689903]
[2024-04-28 11:59:05,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639689903] provided 0 perfect and 1 imperfect interpolant sequences
[2024-04-28 11:59:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743538146]
[2024-04-28 11:59:05,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-04-28 11:59:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:59:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:59:05,237 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)
[2024-04-28 11:59:05,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-04-28 11:59:05,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-04-28 11:59:05,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-04-28 11:59:05,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core
[2024-04-28 11:59:05,281 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-04-28 11:59:05,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 11
[2024-04-28 11:59:05,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2024-04-28 11:59:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:05,369 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-04-28 11:59:05,613 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size
[2024-04-28 11:59:05,613 INFO L378 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 99 treesize of output 96
[2024-04-28 11:59:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743538146] provided 0 perfect and 2 imperfect interpolant sequences
[2024-04-28 11:59:05,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-04-28 11:59:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-04-28 11:59:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588619447]
[2024-04-28 11:59:05,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-04-28 11:59:05,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-04-28 11:59:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:59:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-04-28 11:59:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2024-04-28 11:59:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:05,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:59:05,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:05,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2024-04-28 11:59:08,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-04-28 11:59:08,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:59:08,779 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:59:08,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:59:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash -604551849, now seen corresponding path program 3 times
[2024-04-28 11:59:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:59:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739697156]
[2024-04-28 11:59:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:59:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739697156]
[2024-04-28 11:59:08,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739697156] provided 0 perfect and 1 imperfect interpolant sequences
[2024-04-28 11:59:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935356826]
[2024-04-28 11:59:08,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-04-28 11:59:08,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:59:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:59:08,837 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)
[2024-04-28 11:59:08,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-04-28 11:59:08,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-04-28 11:59:08,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-04-28 11:59:08,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core
[2024-04-28 11:59:08,882 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-04-28 11:59:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-04-28 11:59:08,902 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-04-28 11:59:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-04-28 11:59:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935356826] provided 0 perfect and 2 imperfect interpolant sequences
[2024-04-28 11:59:08,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-04-28 11:59:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6
[2024-04-28 11:59:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416085223]
[2024-04-28 11:59:08,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-04-28 11:59:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-04-28 11:59:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:59:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-04-28 11:59:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-04-28 11:59:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:08,938 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:59:08,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states.
[2024-04-28 11:59:08,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2024-04-28 11:59:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:12,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-04-28 11:59:12,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:59:12,672 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:59:12,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:59:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1969997795, now seen corresponding path program 4 times
[2024-04-28 11:59:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:59:12,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082365702]
[2024-04-28 11:59:12,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:12,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:59:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082365702]
[2024-04-28 11:59:12,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082365702] provided 0 perfect and 1 imperfect interpolant sequences
[2024-04-28 11:59:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294582277]
[2024-04-28 11:59:12,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-04-28 11:59:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:59:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:59:12,757 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)
[2024-04-28 11:59:12,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-04-28 11:59:12,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-04-28 11:59:12,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-04-28 11:59:12,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-04-28 11:59:12,811 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-04-28 11:59:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:12,861 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-04-28 11:59:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-04-28 11:59:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294582277] provided 0 perfect and 2 imperfect interpolant sequences
[2024-04-28 11:59:12,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-04-28 11:59:12,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9
[2024-04-28 11:59:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526220590]
[2024-04-28 11:59:12,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-04-28 11:59:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-04-28 11:59:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-04-28 11:59:12,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-04-28 11:59:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-04-28 11:59:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:12,946 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-04-28 11:59:12,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-04-28 11:59:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:12,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:12,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-04-28 11:59:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-04-28 11:59:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-04-28 11:59:23,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-04-28 11:59:23,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54
[2024-04-28 11:59:23,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2024-04-28 11:59:23,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-04-28 11:59:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash -847992609, now seen corresponding path program 5 times
[2024-04-28 11:59:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-04-28 11:59:23,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665307004]
[2024-04-28 11:59:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-04-28 11:59:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-04-28 11:59:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-04-28 11:59:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-04-28 11:59:24,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-04-28 11:59:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665307004]
[2024-04-28 11:59:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665307004] provided 0 perfect and 1 imperfect interpolant sequences
[2024-04-28 11:59:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272869098]
[2024-04-28 11:59:24,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-04-28 11:59:24,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-04-28 11:59:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-04-28 11:59:24,337 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-04-28 11:59:24,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-04-28 11:59:24,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2024-04-28 11:59:24,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-04-28 11:59:24,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-04-28 11:59:24,387 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2024-04-28 11:59:24,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 11
[2024-04-28 11:59:24,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 42 treesize of output 34
[2024-04-28 11:59:25,019 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-04-28 11:59:25,020 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-04-28 11:59:25,146 INFO L349 Elim1Store]: treesize reduction 112, result has 43.1 percent of original size
[2024-04-28 11:59:25,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 91 treesize of output 147
[2024-04-28 11:59:29,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23
[2024-04-28 11:59:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-04-28 11:59:29,104 INFO L327 TraceCheckSpWp]: Computing backward predicates...
[2024-04-28 11:59:39,322 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_58 Int) (i Int)) (let ((.cse0 (select c_A i))) (or (< c_min .cse0) (< .cse0 (+ (select (store c_A c_l v_ArrVal_58) 0) 2))))) (forall ((v_ArrVal_58 Int) (i Int)) (let ((.cse1 (+ (select (store c_A c_l v_ArrVal_58) 0) 2))) (or (< (select c_A i) .cse1) (< c_min .cse1)))) (or (forall ((i Int)) (< (select c_A i) (+ c_min 1))) (forall ((v_ArrVal_58 Int)) (< c_min (+ (select (store c_A c_l v_ArrVal_58) 0) 2))))) is different from false
[2024-04-28 12:00:24,382 WARN L293 SmtUtils]: Spent 18.02s on a formula simplification that was a NOOP. DAG size: 1051 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1)
[2024-04-28 12:00:24,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-04-28 12:00:24,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 102003 treesize of output 88823
[2024-04-28 12:00:30,245 WARN L293 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 4333 DAG size of output: 2922 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-04-28 12:10:04,991 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory")
[2024-04-28 12:10:04,993 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception
[2024-04-28 12:10:04,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101
[2024-04-28 12:10:04,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-04-28 12:10:05,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55
[2024-04-28 12:10:05,194 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver:
de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")
at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262)
at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277)
at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111)
at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158)
at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:59)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283)
at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184)
at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.<init>(TraceCheckSpWp.java:162)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:82)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:340)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:154)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF
at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518)
at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701)
at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383)
at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258)
... 67 more
[2024-04-28 12:10:05,198 INFO L158 Benchmark]: Toolchain (without parser) took 689976.47ms. Allocated memory was 293.6MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 267.2MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB.
[2024-04-28 12:10:05,198 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 293.6MB. Free memory is still 262.0MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-04-28 12:10:05,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.60ms. Allocated memory is still 293.6MB. Free memory was 267.2MB in the beginning and 265.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-04-28 12:10:05,199 INFO L158 Benchmark]: Boogie Preprocessor took 15.32ms. Allocated memory is still 293.6MB. Free memory was 265.3MB in the beginning and 264.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2024-04-28 12:10:05,199 INFO L158 Benchmark]: RCFGBuilder took 297.50ms. Allocated memory is still 293.6MB. Free memory was 264.1MB in the beginning and 252.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2024-04-28 12:10:05,199 INFO L158 Benchmark]: TraceAbstraction took 689607.18ms. Allocated memory was 293.6MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 251.4MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB.
[2024-04-28 12:10:05,203 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.12ms. Allocated memory is still 293.6MB. Free memory is still 262.0MB. There was no memory consumed. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 50.60ms. Allocated memory is still 293.6MB. Free memory was 267.2MB in the beginning and 265.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 15.32ms. Allocated memory is still 293.6MB. Free memory was 265.3MB in the beginning and 264.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 297.50ms. Allocated memory is still 293.6MB. Free memory was 264.1MB in the beginning and 252.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 689607.18ms. Allocated memory was 293.6MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 251.4MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")
: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2024-04-28 12:10:05,219 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
Received shutdown request...