/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-08 02:50:12,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-08 02:50:12,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-08 02:50:12,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-08 02:50:12,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-08 02:50:12,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-08 02:50:12,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-08 02:50:12,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-08 02:50:12,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-08 02:50:12,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-08 02:50:12,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-08 02:50:12,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-08 02:50:12,078 INFO L153 SettingsManager]: * Use SBE=true [2024-05-08 02:50:12,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-08 02:50:12,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-08 02:50:12,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-08 02:50:12,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-08 02:50:12,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-08 02:50:12,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-08 02:50:12,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-08 02:50:12,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-08 02:50:12,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-08 02:50:12,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-08 02:50:12,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-08 02:50:12,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-08 02:50:12,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-08 02:50:12,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-08 02:50:12,083 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-08 02:50:12,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-08 02:50:12,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 02:50:12,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-08 02:50:12,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-08 02:50:12,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-08 02:50:12,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-08 02:50:12,085 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-08 02:50:12,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-08 02:50:12,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-08 02:50:12,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-08 02:50:12,086 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-08 02:50:12,086 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET 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-05-08 02:50:12,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-08 02:50:12,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-08 02:50:12,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-08 02:50:12,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-08 02:50:12,336 INFO L274 PluginConnector]: CDTParser initialized [2024-05-08 02:50:12,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-05-08 02:50:13,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-08 02:50:13,711 INFO L384 CDTParser]: Found 1 translation units. [2024-05-08 02:50:13,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2024-05-08 02:50:13,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ac7318fd3/b598c6c1840c4e47be27e8b25de241eb/FLAGa8009588c [2024-05-08 02:50:13,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ac7318fd3/b598c6c1840c4e47be27e8b25de241eb [2024-05-08 02:50:13,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-08 02:50:13,753 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-08 02:50:13,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-08 02:50:13,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-08 02:50:13,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-08 02:50:13,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 02:50:13" (1/1) ... [2024-05-08 02:50:13,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225dc172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:13, skipping insertion in model container [2024-05-08 02:50:13,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.05 02:50:13" (1/1) ... [2024-05-08 02:50:13,805 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-08 02:50:14,154 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-05-08 02:50:14,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 02:50:14,209 INFO L202 MainTranslator]: Completed pre-run [2024-05-08 02:50:14,246 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2024-05-08 02:50:14,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-08 02:50:14,301 INFO L206 MainTranslator]: Completed translation [2024-05-08 02:50:14,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14 WrapperNode [2024-05-08 02:50:14,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-08 02:50:14,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-08 02:50:14,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-08 02:50:14,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-08 02:50:14,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,356 INFO L138 Inliner]: procedures = 272, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 288 [2024-05-08 02:50:14,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-08 02:50:14,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-08 02:50:14,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-08 02:50:14,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-08 02:50:14,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-08 02:50:14,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-08 02:50:14,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-08 02:50:14,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-08 02:50:14,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (1/1) ... [2024-05-08 02:50:14,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-08 02:50:14,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:14,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:14,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-08 02:50:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-05-08 02:50:14,481 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-08 02:50:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-08 02:50:14,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-08 02:50:14,482 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-08 02:50:14,623 INFO L241 CfgBuilder]: Building ICFG [2024-05-08 02:50:14,625 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-08 02:50:14,929 INFO L282 CfgBuilder]: Performing block encoding [2024-05-08 02:50:14,969 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-08 02:50:14,970 INFO L309 CfgBuilder]: Removed 35 assume(true) statements. [2024-05-08 02:50:14,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 02:50:14 BoogieIcfgContainer [2024-05-08 02:50:14,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-08 02:50:14,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-08 02:50:14,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-08 02:50:14,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-08 02:50:14,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.05 02:50:13" (1/3) ... [2024-05-08 02:50:14,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41812a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 02:50:14, skipping insertion in model container [2024-05-08 02:50:14,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.05 02:50:14" (2/3) ... [2024-05-08 02:50:14,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41812a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.05 02:50:14, skipping insertion in model container [2024-05-08 02:50:14,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.05 02:50:14" (3/3) ... [2024-05-08 02:50:14,978 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2024-05-08 02:50:14,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-08 02:50:14,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-08 02:50:14,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-08 02:50:14,993 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-08 02:50:15,045 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-08 02:50:15,079 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:50:15,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:50:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:15,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-08 02:50:15,155 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:50:15,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:15,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:50:15,176 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:50:15,176 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-08 02:50:15,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:50:15,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash 700882477, now seen corresponding path program 1 times [2024-05-08 02:50:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913065660] [2024-05-08 02:50:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:15,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913065660] [2024-05-08 02:50:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913065660] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:15,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:15,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:50:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576502233] [2024-05-08 02:50:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:15,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:50:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:50:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:50:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:15,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-05-08 02:50:15,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:15,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-08 02:50:15,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:50:15,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1073560970, now seen corresponding path program 1 times [2024-05-08 02:50:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260621121] [2024-05-08 02:50:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:15,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:15,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260621121] [2024-05-08 02:50:15,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260621121] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:15,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174928303] [2024-05-08 02:50:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:15,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:15,818 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-05-08 02:50:15,845 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-05-08 02:50:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:15,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:50:15,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:15,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174928303] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:15,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:50:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161521186] [2024-05-08 02:50:15,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:15,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:50:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:50:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:50:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:16,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:16,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:16,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-08 02:50:16,303 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,SelfDestructingSolverStorable1 [2024-05-08 02:50:16,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:50:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash 870645974, now seen corresponding path program 2 times [2024-05-08 02:50:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:16,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733382962] [2024-05-08 02:50:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:16,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:16,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733382962] [2024-05-08 02:50:16,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733382962] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:16,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388092750] [2024-05-08 02:50:16,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:16,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:16,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:16,447 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-05-08 02:50:16,452 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-05-08 02:50:16,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:16,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:16,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:50:16,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:16,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:16,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388092750] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:16,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:16,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:50:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537768769] [2024-05-08 02:50:16,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:16,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:50:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:50:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:50:16,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:16,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:16,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:16,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:16,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:16,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:16,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-08 02:50:17,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:17,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:50:17,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1644696982, now seen corresponding path program 3 times [2024-05-08 02:50:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764958538] [2024-05-08 02:50:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:17,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:17,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764958538] [2024-05-08 02:50:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764958538] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:17,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152880985] [2024-05-08 02:50:17,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:50:17,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:17,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:17,434 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-05-08 02:50:17,439 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-05-08 02:50:17,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-08 02:50:17,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:17,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-08 02:50:17,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:17,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-08 02:50:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152880985] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:17,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-05-08 02:50:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564044320] [2024-05-08 02:50:17,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:17,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:50:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:50:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:50:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:17,775 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:17,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 23 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:17,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:17,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:17,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:17,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:18,035 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-05-08 02:50:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:18,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-08 02:50:18,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1535464883, now seen corresponding path program 4 times [2024-05-08 02:50:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284826487] [2024-05-08 02:50:18,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:18,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:50:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:18,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:50:18,283 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:50:18,283 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-05-08 02:50:18,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-05-08 02:50:18,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-05-08 02:50:18,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-05-08 02:50:18,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-05-08 02:50:18,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-08 02:50:18,289 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1] [2024-05-08 02:50:18,290 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:50:18,290 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-05-08 02:50:18,314 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-08 02:50:18,317 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:50:18,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:50:18,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:18,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:18,323 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:50:18,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:18,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:50:18,323 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:50:18,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-05-08 02:50:18,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-05-08 02:50:18,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 02:50:18,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:18,341 INFO L85 PathProgramCache]: Analyzing trace with hash -368786518, now seen corresponding path program 1 times [2024-05-08 02:50:18,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:18,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443286794] [2024-05-08 02:50:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:18,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443286794] [2024-05-08 02:50:18,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443286794] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:18,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:18,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:50:18,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417658876] [2024-05-08 02:50:18,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:18,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:50:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:50:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:50:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:18,382 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:18,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:18,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:18,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:18,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-08 02:50:18,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 02:50:18,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1959824080, now seen corresponding path program 1 times [2024-05-08 02:50:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140567535] [2024-05-08 02:50:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:18,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140567535] [2024-05-08 02:50:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140567535] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354936349] [2024-05-08 02:50:18,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:18,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:18,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:18,456 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-05-08 02:50:18,480 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-05-08 02:50:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:18,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:50:18,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:18,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354936349] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:18,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:18,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:50:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889587086] [2024-05-08 02:50:18,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:18,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:50:18,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:18,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:50:18,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:50:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:18,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:18,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:18,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:18,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:18,652 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-05-08 02:50:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:18,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 02:50:18,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash 507978672, now seen corresponding path program 2 times [2024-05-08 02:50:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914751264] [2024-05-08 02:50:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:18,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914751264] [2024-05-08 02:50:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914751264] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269430433] [2024-05-08 02:50:18,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:18,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:18,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:18,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:19,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-08 02:50:19,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:19,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:19,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:50:19,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:19,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:19,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269430433] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:19,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:19,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:50:19,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490689666] [2024-05-08 02:50:19,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:19,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:50:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:50:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:50:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:19,197 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:19,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.277777777777778) internal successors, (95), 18 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:19,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:19,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:19,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:19,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:19,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-08 02:50:19,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 02:50:19,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1231429808, now seen corresponding path program 3 times [2024-05-08 02:50:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:19,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400800185] [2024-05-08 02:50:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:19,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400800185] [2024-05-08 02:50:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400800185] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341347616] [2024-05-08 02:50:19,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:50:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:19,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:19,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-08 02:50:19,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-08 02:50:19,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:19,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:50:19,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:20,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:50:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-08 02:50:20,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:20,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-08 02:50:20,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341347616] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:20,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:20,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 32 [2024-05-08 02:50:20,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285582126] [2024-05-08 02:50:20,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:20,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-08 02:50:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-08 02:50:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-05-08 02:50:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:20,353 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:20,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.28125) internal successors, (201), 32 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:20,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:20,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:20,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:20,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:21,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:21,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:21,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 02:50:21,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash -712979179, now seen corresponding path program 1 times [2024-05-08 02:50:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813803253] [2024-05-08 02:50:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813803253] [2024-05-08 02:50:21,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813803253] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942703315] [2024-05-08 02:50:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:21,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:21,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:21,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-08 02:50:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:21,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 02:50:21,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:21,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-08 02:50:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942703315] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:21,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 02:50:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290219360] [2024-05-08 02:50:21,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:50:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:21,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:50:21,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:50:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:21,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:21,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.695652173913044) internal successors, (108), 23 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:21,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:21,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:21,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:21,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:21,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:22,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:22,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-08 02:50:22,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-05-08 02:50:22,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1752755861, now seen corresponding path program 2 times [2024-05-08 02:50:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487768375] [2024-05-08 02:50:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:22,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:50:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:22,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:50:22,307 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:50:22,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-05-08 02:50:22,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-05-08 02:50:22,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-05-08 02:50:22,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-05-08 02:50:22,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-05-08 02:50:22,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-05-08 02:50:22,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-08 02:50:22,309 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1] [2024-05-08 02:50:22,309 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:50:22,309 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-05-08 02:50:22,332 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-08 02:50:22,335 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:50:22,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:50:22,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:22,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:22,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-05-08 02:50:22,387 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:50:22,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:22,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:50:22,387 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:50:22,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-08 02:50:22,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:22,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash 598061514, now seen corresponding path program 1 times [2024-05-08 02:50:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:22,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224650891] [2024-05-08 02:50:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:22,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-05-08 02:50:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224650891] [2024-05-08 02:50:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224650891] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:50:22,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777523221] [2024-05-08 02:50:22,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:22,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:50:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:50:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:50:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:22,471 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:22,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:22,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:22,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-08 02:50:22,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:22,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1195334197, now seen corresponding path program 1 times [2024-05-08 02:50:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:22,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071121848] [2024-05-08 02:50:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071121848] [2024-05-08 02:50:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071121848] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124459904] [2024-05-08 02:50:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:22,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:22,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:22,604 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:22,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-08 02:50:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:22,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:50:22,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:22,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:22,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124459904] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:22,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:22,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:50:22,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294414838] [2024-05-08 02:50:22,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:22,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:50:22,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:50:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:50:22,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:22,795 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:22,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:22,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:22,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:22,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:22,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:23,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:23,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:23,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:23,060 INFO L85 PathProgramCache]: Analyzing trace with hash -500207019, now seen corresponding path program 2 times [2024-05-08 02:50:23,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:23,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724608062] [2024-05-08 02:50:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:23,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:23,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724608062] [2024-05-08 02:50:23,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724608062] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:23,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478294186] [2024-05-08 02:50:23,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:23,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:23,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:23,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-08 02:50:23,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:23,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:23,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:50:23,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:23,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:23,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478294186] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:23,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:23,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:50:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552115615] [2024-05-08 02:50:23,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:23,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:50:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:50:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:50:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:23,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:23,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:23,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:23,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:23,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:23,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:23,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-05-08 02:50:23,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:23,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1267378837, now seen corresponding path program 3 times [2024-05-08 02:50:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:23,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127170264] [2024-05-08 02:50:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127170264] [2024-05-08 02:50:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127170264] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:24,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477482174] [2024-05-08 02:50:24,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:50:24,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:24,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:24,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:24,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-08 02:50:24,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-08 02:50:24,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:24,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:50:24,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:24,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:50:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-08 02:50:24,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:24,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-08 02:50:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477482174] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:24,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 9] total 32 [2024-05-08 02:50:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557131981] [2024-05-08 02:50:24,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-05-08 02:50:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-05-08 02:50:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2024-05-08 02:50:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:24,732 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:24,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.0) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:25,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-05-08 02:50:25,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-08 02:50:25,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:25,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash -624715901, now seen corresponding path program 1 times [2024-05-08 02:50:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031792313] [2024-05-08 02:50:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:25,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031792313] [2024-05-08 02:50:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031792313] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:25,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264211302] [2024-05-08 02:50:25,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:25,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:25,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:25,842 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:25,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-08 02:50:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:26,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 02:50:26,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:26,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-08 02:50:26,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264211302] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:26,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:26,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 02:50:26,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778033570] [2024-05-08 02:50:26,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:26,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:50:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:26,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:50:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:50:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:26,250 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:26,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 23 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:26,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:26,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:26,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:26,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:26,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:26,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:26,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-08 02:50:26,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:26,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -64027805, now seen corresponding path program 2 times [2024-05-08 02:50:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:26,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977686197] [2024-05-08 02:50:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-08 02:50:27,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977686197] [2024-05-08 02:50:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977686197] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682572266] [2024-05-08 02:50:27,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:27,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:27,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:27,426 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:27,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-08 02:50:27,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:27,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:27,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:50:27,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:27,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-08 02:50:27,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:27,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 35 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-08 02:50:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682572266] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:27,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-08 02:50:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985823912] [2024-05-08 02:50:27,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:27,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-08 02:50:27,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-08 02:50:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-05-08 02:50:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:28,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:28,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.153846153846153) internal successors, (212), 26 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-08 02:50:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:28,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:28,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:28,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-08 02:50:28,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:28,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2137989880, now seen corresponding path program 1 times [2024-05-08 02:50:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600542564] [2024-05-08 02:50:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-08 02:50:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600542564] [2024-05-08 02:50:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600542564] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270305769] [2024-05-08 02:50:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:29,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:29,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:29,198 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:29,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-08 02:50:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:29,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:50:29,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:29,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-08 02:50:29,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:29,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-05-08 02:50:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270305769] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:29,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-08 02:50:29,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449067233] [2024-05-08 02:50:29,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:29,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-08 02:50:29,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-08 02:50:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2024-05-08 02:50:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:29,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:29,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.076923076923077) internal successors, (236), 26 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:29,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:29,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:29,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:29,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:29,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:29,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:29,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:30,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:30,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-08 02:50:30,266 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-08 02:50:30,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:30,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1993793129, now seen corresponding path program 1 times [2024-05-08 02:50:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420683062] [2024-05-08 02:50:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:30,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:50:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:30,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:50:30,299 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-05-08 02:50:30,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-08 02:50:30,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-08 02:50:30,301 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-05-08 02:50:30,301 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:50:30,301 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-05-08 02:50:30,329 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-08 02:50:30,331 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:50:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:50:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:30,332 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-05-08 02:50:30,336 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:50:30,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:30,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:50:30,337 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:50:30,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-08 02:50:30,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:30,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1194040010, now seen corresponding path program 1 times [2024-05-08 02:50:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:30,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449124381] [2024-05-08 02:50:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:30,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-05-08 02:50:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449124381] [2024-05-08 02:50:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449124381] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:50:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540946308] [2024-05-08 02:50:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:30,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:50:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:50:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:50:30,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:30,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:30,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:30,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:30,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-08 02:50:30,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:30,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1156516566, now seen corresponding path program 1 times [2024-05-08 02:50:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395128020] [2024-05-08 02:50:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:30,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:30,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395128020] [2024-05-08 02:50:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395128020] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006509275] [2024-05-08 02:50:30,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:30,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:30,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:30,632 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:30,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-08 02:50:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:30,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:50:30,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:30,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006509275] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:30,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:30,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:50:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168693047] [2024-05-08 02:50:30,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:30,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:50:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:50:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:50:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:30,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:30,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:30,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:30,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:30,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:31,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-08 02:50:31,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:31,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2005481558, now seen corresponding path program 2 times [2024-05-08 02:50:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312103338] [2024-05-08 02:50:31,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312103338] [2024-05-08 02:50:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312103338] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:31,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349040514] [2024-05-08 02:50:31,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:31,311 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:31,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-08 02:50:31,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:31,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:31,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:50:31,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:31,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:31,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349040514] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:31,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:31,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:50:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016075563] [2024-05-08 02:50:31,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:31,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:50:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:50:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:50:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:31,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:31,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:31,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:31,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:31,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:31,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:31,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:31,978 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:31,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1755640662, now seen corresponding path program 3 times [2024-05-08 02:50:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:31,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312450033] [2024-05-08 02:50:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:32,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312450033] [2024-05-08 02:50:32,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312450033] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:32,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942412879] [2024-05-08 02:50:32,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:50:32,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:32,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:32,202 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:32,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-05-08 02:50:32,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-08 02:50:32,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:32,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-08 02:50:32,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:32,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:50:32,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:32,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-08 02:50:33,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:33,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-08 02:50:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-08 02:50:33,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:33,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1008) |c_~#cache~0.base|) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:50:33,245 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1008) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:50:33,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:33,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:50:33,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:33,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:50:33,284 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 22 treesize of output 18 [2024-05-08 02:50:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 30 not checked. [2024-05-08 02:50:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942412879] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:33,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2024-05-08 02:50:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180541676] [2024-05-08 02:50:33,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:33,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-08 02:50:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:33,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-08 02:50:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1040, Unknown=2, NotChecked=134, Total=1332 [2024-05-08 02:50:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:33,546 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:33,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 9.432432432432432) internal successors, (349), 37 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:33,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:33,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:33,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:33,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-08 02:50:34,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-05-08 02:50:34,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:34,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2128885073, now seen corresponding path program 1 times [2024-05-08 02:50:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178708476] [2024-05-08 02:50:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178708476] [2024-05-08 02:50:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178708476] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703715266] [2024-05-08 02:50:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:34,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:34,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:34,897 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:34,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-05-08 02:50:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:35,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 02:50:35,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:35,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-08 02:50:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703715266] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:35,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 02:50:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983499343] [2024-05-08 02:50:35,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:35,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:50:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:50:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:50:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:35,318 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:35,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:35,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:35,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:35,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:35,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-08 02:50:35,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-05-08 02:50:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:35,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:35,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:35,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:35,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1394231343, now seen corresponding path program 2 times [2024-05-08 02:50:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:35,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333533375] [2024-05-08 02:50:35,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 65 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-08 02:50:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333533375] [2024-05-08 02:50:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333533375] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506811557] [2024-05-08 02:50:36,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:36,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:36,239 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:36,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-05-08 02:50:36,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:36,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:36,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:50:36,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:36,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:50:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:50:36,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:36,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 55 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:50:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506811557] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:37,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:37,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-08 02:50:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553982500] [2024-05-08 02:50:37,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:37,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-08 02:50:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-08 02:50:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-05-08 02:50:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:37,037 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:37,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.923076923076923) internal successors, (258), 26 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:37,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:37,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:37,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:37,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-05-08 02:50:37,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:37,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:50:37,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:37,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-05-08 02:50:37,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:37,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:37,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2146101693, now seen corresponding path program 1 times [2024-05-08 02:50:37,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997826638] [2024-05-08 02:50:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:50:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997826638] [2024-05-08 02:50:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997826638] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754481257] [2024-05-08 02:50:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:38,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:38,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:38,451 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:38,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-05-08 02:50:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:38,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 29 conjunts are in the unsatisfiable core [2024-05-08 02:50:38,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:38,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:39,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:39,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:50:39,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:39,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:50:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:50:39,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:39,370 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1270) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:50:39,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:39,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:50:39,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:39,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:50:39,458 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 22 treesize of output 18 [2024-05-08 02:50:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 35 not checked. [2024-05-08 02:50:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754481257] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:39,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 33 [2024-05-08 02:50:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344223186] [2024-05-08 02:50:39,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:39,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-05-08 02:50:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:39,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-05-08 02:50:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=855, Unknown=6, NotChecked=60, Total=1056 [2024-05-08 02:50:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:39,637 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:39,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 9.030303030303031) internal successors, (298), 33 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:39,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:39,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:39,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:39,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:39,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:39,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:50:39,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:40,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-05-08 02:50:40,253 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-08 02:50:40,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2005270274, now seen corresponding path program 1 times [2024-05-08 02:50:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:40,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086746370] [2024-05-08 02:50:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:40,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:50:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:40,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:50:40,348 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:50:40,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-05-08 02:50:40,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-05-08 02:50:40,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2024-05-08 02:50:40,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-05-08 02:50:40,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-05-08 02:50:40,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-05-08 02:50:40,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-05-08 02:50:40,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-05-08 02:50:40,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-08 02:50:40,350 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-05-08 02:50:40,350 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:50:40,350 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-05-08 02:50:40,381 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-05-08 02:50:40,385 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:50:40,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:50:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:40,386 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:40,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2024-05-08 02:50:40,407 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:50:40,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:40,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:50:40,407 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:50:40,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-08 02:50:40,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:40,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1601781207, now seen corresponding path program 1 times [2024-05-08 02:50:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:40,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742493702] [2024-05-08 02:50:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-05-08 02:50:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742493702] [2024-05-08 02:50:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742493702] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:40,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:40,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:50:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59390501] [2024-05-08 02:50:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:40,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:50:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:50:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:50:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:40,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:40,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:40,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-08 02:50:40,730 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:40,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 906566645, now seen corresponding path program 1 times [2024-05-08 02:50:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288436731] [2024-05-08 02:50:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:40,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288436731] [2024-05-08 02:50:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288436731] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509104923] [2024-05-08 02:50:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:40,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:40,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:40,800 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:40,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-05-08 02:50:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:41,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:50:41,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:41,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509104923] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:41,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:50:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792920409] [2024-05-08 02:50:41,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:41,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:50:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:41,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:50:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:50:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:41,091 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:41,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:41,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:41,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:41,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:41,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-05-08 02:50:41,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:41,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1260418475, now seen corresponding path program 2 times [2024-05-08 02:50:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642531075] [2024-05-08 02:50:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:41,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642531075] [2024-05-08 02:50:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642531075] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061182364] [2024-05-08 02:50:41,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:50:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:41,490 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:41,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-05-08 02:50:41,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:50:41,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:41,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:50:41,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:41,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061182364] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:41,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:50:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678147034] [2024-05-08 02:50:41,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:41,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:50:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:50:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:50:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:41,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:41,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.944444444444445) internal successors, (179), 18 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:41,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:41,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:41,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:42,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:42,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:42,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1702297365, now seen corresponding path program 3 times [2024-05-08 02:50:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:42,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205430900] [2024-05-08 02:50:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:42,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:42,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:42,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205430900] [2024-05-08 02:50:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205430900] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:42,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727562982] [2024-05-08 02:50:42,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:50:42,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:42,494 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:42,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-05-08 02:50:42,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-08 02:50:42,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:50:42,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-08 02:50:42,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:43,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:50:43,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:43,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-08 02:50:43,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:43,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-08 02:50:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 95 proven. 5 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-05-08 02:50:43,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:43,663 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1674) |c_~#cache~0.base|) (+ (* |c_t_funThread4of5ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:50:43,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1674 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1674) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:50:43,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:43,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:50:43,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:50:43,716 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 22 treesize of output 18 [2024-05-08 02:50:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 30 not checked. [2024-05-08 02:50:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727562982] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:43,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2024-05-08 02:50:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519508889] [2024-05-08 02:50:43,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:43,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-08 02:50:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:44,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-08 02:50:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1040, Unknown=2, NotChecked=134, Total=1332 [2024-05-08 02:50:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:44,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:44,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 10.621621621621621) internal successors, (393), 37 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:44,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:44,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:44,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:44,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:45,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:45,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:45,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:45,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1030522031, now seen corresponding path program 1 times [2024-05-08 02:50:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:45,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250125573] [2024-05-08 02:50:45,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:45,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:45,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250125573] [2024-05-08 02:50:45,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250125573] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:45,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295346854] [2024-05-08 02:50:45,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:45,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:45,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:45,467 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:45,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-05-08 02:50:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:45,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 02:50:45,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:45,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-08 02:50:45,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295346854] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:45,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 02:50:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848515487] [2024-05-08 02:50:45,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:45,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:50:45,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:46,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:50:46,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:50:46,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:46,004 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:46,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.26086956521739) internal successors, (190), 23 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:46,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:46,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:46,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:46,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:46,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:46,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-05-08 02:50:46,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:46,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:46,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash 828394063, now seen corresponding path program 2 times [2024-05-08 02:50:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:46,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3203850] [2024-05-08 02:50:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-05-08 02:50:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:47,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3203850] [2024-05-08 02:50:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3203850] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:47,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:47,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-08 02:50:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631816174] [2024-05-08 02:50:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:47,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-08 02:50:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-08 02:50:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-05-08 02:50:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:47,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:47,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.636363636363637) internal successors, (161), 11 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:47,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:47,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:47,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:47,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:47,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:47,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:47,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-08 02:50:47,421 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:47,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1122362463, now seen corresponding path program 1 times [2024-05-08 02:50:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504683542] [2024-05-08 02:50:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 50 proven. 65 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-08 02:50:48,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:48,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504683542] [2024-05-08 02:50:48,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504683542] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:48,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421250004] [2024-05-08 02:50:48,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:48,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:48,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:48,285 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:48,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-05-08 02:50:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:48,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:50:48,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:48,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 65 proven. 50 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-08 02:50:48,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:48,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 75 proven. 40 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-08 02:50:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421250004] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:49,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:49,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 31 [2024-05-08 02:50:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293813377] [2024-05-08 02:50:49,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:49,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-08 02:50:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:49,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-08 02:50:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2024-05-08 02:50:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:49,384 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:49,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 14.0) internal successors, (434), 31 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:49,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:49,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:49,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-08 02:50:50,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2024-05-08 02:50:50,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:50,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:50,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 77453119, now seen corresponding path program 1 times [2024-05-08 02:50:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:50,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728745132] [2024-05-08 02:50:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 105 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-08 02:50:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728745132] [2024-05-08 02:50:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728745132] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:51,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029216254] [2024-05-08 02:50:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:51,492 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:51,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-05-08 02:50:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:51,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:50:51,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:51,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:50:52,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:52,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:50:52,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029216254] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:52,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:52,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 31 [2024-05-08 02:50:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182076184] [2024-05-08 02:50:52,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-05-08 02:50:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:52,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-05-08 02:50:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2024-05-08 02:50:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:52,340 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:52,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.612903225806452) internal successors, (360), 31 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:52,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:52,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:52,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:52,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:50:52,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:52,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:52,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-08 02:50:52,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:50:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:53,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:53,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-05-08 02:50:53,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:53,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash 32601087, now seen corresponding path program 1 times [2024-05-08 02:50:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874921799] [2024-05-08 02:50:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 100 proven. 5 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:50:54,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874921799] [2024-05-08 02:50:54,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874921799] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:54,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522096006] [2024-05-08 02:50:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:54,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:54,418 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:54,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-05-08 02:50:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:54,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 35 conjunts are in the unsatisfiable core [2024-05-08 02:50:54,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:54,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:55,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:55,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:50:55,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:50:55,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:50:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:50:55,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:55,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:55,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:50:55,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:50:55,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:50:55,323 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 22 treesize of output 18 [2024-05-08 02:50:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 75 proven. 15 refuted. 10 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:50:55,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522096006] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:55,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2024-05-08 02:50:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032130912] [2024-05-08 02:50:55,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-08 02:50:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-08 02:50:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1110, Unknown=7, NotChecked=0, Total=1260 [2024-05-08 02:50:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:55,523 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:55,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.5) internal successors, (378), 36 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:55,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:55,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:55,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:55,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:55,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:55,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:55,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:50:55,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:55,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:56,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-05-08 02:50:56,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-05-08 02:50:56,675 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:56,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1360042307, now seen corresponding path program 1 times [2024-05-08 02:50:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713821310] [2024-05-08 02:50:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:50:57,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:57,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713821310] [2024-05-08 02:50:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713821310] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:57,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498537792] [2024-05-08 02:50:57,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:57,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:57,064 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:57,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-05-08 02:50:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:57,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:50:57,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:50:57,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:50:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-08 02:50:57,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:50:57,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:50:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 75 proven. 35 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-08 02:50:58,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498537792] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:50:58,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:50:58,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-08 02:50:58,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092610558] [2024-05-08 02:50:58,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:50:58,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:50:58,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:58,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:50:58,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:50:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:58,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:58,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.851851851851851) internal successors, (401), 27 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:50:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-08 02:50:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:50:58,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2024-05-08 02:50:59,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-05-08 02:50:59,000 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-05-08 02:50:59,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:59,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1244947077, now seen corresponding path program 1 times [2024-05-08 02:50:59,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:59,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208014066] [2024-05-08 02:50:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:59,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:59,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:50:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:50:59,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:50:59,053 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2024-05-08 02:50:59,053 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2024-05-08 02:50:59,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2024-05-08 02:50:59,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-05-08 02:50:59,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-08 02:50:59,054 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2024-05-08 02:50:59,055 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:50:59,055 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-05-08 02:50:59,102 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-05-08 02:50:59,106 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:50:59,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:50:59,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:59,130 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:50:59,132 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:50:59,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:59,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:50:59,133 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:50:59,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-05-08 02:50:59,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (34)] Waiting until timeout for monitored process [2024-05-08 02:50:59,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:50:59,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 879549218, now seen corresponding path program 1 times [2024-05-08 02:50:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049236353] [2024-05-08 02:50:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-05-08 02:50:59,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:59,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049236353] [2024-05-08 02:50:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049236353] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:50:59,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:50:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:50:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587054998] [2024-05-08 02:50:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:50:59,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:50:59,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:50:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:50:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:50:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:59,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:50:59,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:50:59,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:50:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:50:59,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-08 02:50:59,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:50:59,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:50:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -309198185, now seen corresponding path program 1 times [2024-05-08 02:50:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:50:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179361292] [2024-05-08 02:50:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:50:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:50:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:50:59,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179361292] [2024-05-08 02:50:59,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179361292] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:50:59,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284674914] [2024-05-08 02:50:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:50:59,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:50:59,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:50:59,683 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:50:59,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-05-08 02:50:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:50:59,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:50:59,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:00,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284674914] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:00,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:51:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816471354] [2024-05-08 02:51:00,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:00,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:51:00,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:00,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:51:00,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:51:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:00,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:00,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.3) internal successors, (203), 10 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:00,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:00,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:00,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:00,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-05-08 02:51:00,402 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:00,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 845749271, now seen corresponding path program 2 times [2024-05-08 02:51:00,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:00,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553515436] [2024-05-08 02:51:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:00,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:00,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553515436] [2024-05-08 02:51:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553515436] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:00,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119842155] [2024-05-08 02:51:00,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:51:00,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:00,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:00,544 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:00,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-05-08 02:51:00,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:51:00,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:51:00,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:51:00,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:00,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119842155] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:00,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:51:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790939711] [2024-05-08 02:51:00,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:00,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:51:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:01,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:51:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:51:01,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:01,005 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:01,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.38888888888889) internal successors, (223), 18 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:01,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:01,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:01,005 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:01,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2024-05-08 02:51:01,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:01,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:01,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 236564247, now seen corresponding path program 3 times [2024-05-08 02:51:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599304831] [2024-05-08 02:51:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599304831] [2024-05-08 02:51:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599304831] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820707781] [2024-05-08 02:51:01,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:51:01,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:01,665 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:01,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-05-08 02:51:02,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-05-08 02:51:02,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:51:02,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-08 02:51:02,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:02,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:51:03,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:03,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-08 02:51:03,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:03,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-05-08 02:51:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 141 proven. 5 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-05-08 02:51:03,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:03,265 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2868 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2868) |c_~#cache~0.base|) (+ (* |c_t_funThread4of6ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:51:03,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:03,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:51:03,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:03,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:51:03,340 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 22 treesize of output 18 [2024-05-08 02:51:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 15 not checked. [2024-05-08 02:51:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820707781] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:03,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:03,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 37 [2024-05-08 02:51:03,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644265948] [2024-05-08 02:51:03,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:03,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-08 02:51:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-08 02:51:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1102, Unknown=3, NotChecked=68, Total=1332 [2024-05-08 02:51:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:03,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:03,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 11.81081081081081) internal successors, (437), 37 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:03,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:03,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:03,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:03,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:51:04,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-05-08 02:51:04,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:04,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash 705816712, now seen corresponding path program 1 times [2024-05-08 02:51:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552956337] [2024-05-08 02:51:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:05,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552956337] [2024-05-08 02:51:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552956337] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501034669] [2024-05-08 02:51:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:05,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:05,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:05,088 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:05,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-05-08 02:51:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:05,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 02:51:05,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:05,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-05-08 02:51:05,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501034669] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:05,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 02:51:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386729741] [2024-05-08 02:51:05,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:05,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:51:05,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:51:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:51:05,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:05,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:05,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:05,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:05,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:05,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:05,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:51:05,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:51:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:06,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:06,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:06,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:06,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash 272802312, now seen corresponding path program 2 times [2024-05-08 02:51:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631671854] [2024-05-08 02:51:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 101 proven. 5 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-08 02:51:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631671854] [2024-05-08 02:51:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631671854] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984905828] [2024-05-08 02:51:07,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:51:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:07,053 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:07,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-05-08 02:51:07,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:51:07,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:51:07,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:51:07,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:07,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 101 proven. 5 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-08 02:51:07,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:07,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:51:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 101 proven. 5 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-08 02:51:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984905828] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:07,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-08 02:51:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183430840] [2024-05-08 02:51:07,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:07,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-08 02:51:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-08 02:51:07,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2024-05-08 02:51:07,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:07,909 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:07,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:07,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:07,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:07,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:07,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:51:07,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:07,909 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:51:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:08,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:08,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-05-08 02:51:08,710 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:08,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash 370425860, now seen corresponding path program 1 times [2024-05-08 02:51:08,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239485261] [2024-05-08 02:51:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:08,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-05-08 02:51:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:09,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239485261] [2024-05-08 02:51:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239485261] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:51:09,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:51:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-08 02:51:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322362074] [2024-05-08 02:51:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:51:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-08 02:51:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:09,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-08 02:51:09,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-05-08 02:51:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:09,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:09,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:09,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:09,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-08 02:51:09,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:09,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash -698615587, now seen corresponding path program 1 times [2024-05-08 02:51:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266701721] [2024-05-08 02:51:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-05-08 02:51:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266701721] [2024-05-08 02:51:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266701721] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535485990] [2024-05-08 02:51:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:12,023 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:12,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-05-08 02:51:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:12,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:51:12,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:13,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:51:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 146 proven. 10 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:51:13,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:13,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 16 [2024-05-08 02:51:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:51:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535485990] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:13,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:13,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10, 9] total 45 [2024-05-08 02:51:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707684888] [2024-05-08 02:51:13,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:13,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-05-08 02:51:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:13,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-05-08 02:51:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2024-05-08 02:51:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:13,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 11.244444444444444) internal successors, (506), 45 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:13,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-08 02:51:16,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2024-05-08 02:51:17,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,40 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:17,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:17,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -672720256, now seen corresponding path program 1 times [2024-05-08 02:51:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616628152] [2024-05-08 02:51:17,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 126 proven. 50 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-08 02:51:17,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:17,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616628152] [2024-05-08 02:51:17,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616628152] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:17,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390122341] [2024-05-08 02:51:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:17,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:17,981 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:17,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-05-08 02:51:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:18,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-08 02:51:18,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:18,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:18,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:18,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:51:18,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:18,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:51:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 15 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-08 02:51:18,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:19,009 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3526 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_3526) |c_~#cache~0.base|) (+ (* |c_t_funThread4of6ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:51:19,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3526 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_3526) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:51:19,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:19,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:51:19,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:19,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:51:19,109 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 22 treesize of output 18 [2024-05-08 02:51:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 40 not checked. [2024-05-08 02:51:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390122341] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:19,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:19,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2024-05-08 02:51:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492536542] [2024-05-08 02:51:19,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:19,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-08 02:51:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-08 02:51:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=993, Unknown=2, NotChecked=130, Total=1260 [2024-05-08 02:51:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:19,352 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:19,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.055555555555555) internal successors, (398), 36 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-08 02:51:19,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-08 02:51:20,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-08 02:51:20,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:20,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2024-05-08 02:51:20,922 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:20,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1375090395, now seen corresponding path program 1 times [2024-05-08 02:51:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:20,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270844766] [2024-05-08 02:51:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 20 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:51:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270844766] [2024-05-08 02:51:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270844766] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565002161] [2024-05-08 02:51:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:21,365 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:21,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-05-08 02:51:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:21,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:51:21,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:22,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 116 proven. 45 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:51:22,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:22,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:51:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 20 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:51:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565002161] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:22,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:22,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-08 02:51:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688483293] [2024-05-08 02:51:22,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:22,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:51:22,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:51:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:51:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:22,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:22,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.074074074074073) internal successors, (434), 27 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-08 02:51:22,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-05-08 02:51:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:22,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:23,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-05-08 02:51:23,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:23,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1396044319, now seen corresponding path program 1 times [2024-05-08 02:51:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628736727] [2024-05-08 02:51:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 35 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:51:23,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:23,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628736727] [2024-05-08 02:51:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628736727] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300741514] [2024-05-08 02:51:23,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:23,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:23,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:23,537 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:23,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2024-05-08 02:51:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:23,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 34 conjunts are in the unsatisfiable core [2024-05-08 02:51:23,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:24,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:51:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:51:24,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:24,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:51:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 35 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:51:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300741514] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:24,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:24,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2024-05-08 02:51:24,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550932479] [2024-05-08 02:51:24,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:24,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:51:24,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:24,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:51:24,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:51:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:24,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:24,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.444444444444445) internal successors, (417), 27 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:24,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:24,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:24,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:51:25,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:25,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:25,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:25,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash -762435814, now seen corresponding path program 1 times [2024-05-08 02:51:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492563710] [2024-05-08 02:51:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 95 proven. 61 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:51:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492563710] [2024-05-08 02:51:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492563710] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185659708] [2024-05-08 02:51:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:26,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:26,778 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:26,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-05-08 02:51:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:27,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:51:27,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:27,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 121 proven. 50 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-08 02:51:27,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:27,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:51:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 40 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-08 02:51:27,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185659708] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:27,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:27,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 9] total 35 [2024-05-08 02:51:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129986848] [2024-05-08 02:51:27,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:27,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-08 02:51:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:28,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-08 02:51:28,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2024-05-08 02:51:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:28,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:28,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 13.714285714285714) internal successors, (480), 35 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:51:28,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:51:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:51:29,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:29,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-05-08 02:51:29,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:29,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash 742268639, now seen corresponding path program 1 times [2024-05-08 02:51:29,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:29,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531628654] [2024-05-08 02:51:29,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:51:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531628654] [2024-05-08 02:51:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531628654] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844472597] [2024-05-08 02:51:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:29,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:29,996 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:29,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2024-05-08 02:51:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:30,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 34 conjunts are in the unsatisfiable core [2024-05-08 02:51:30,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:31,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:51:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 121 proven. 35 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:51:31,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:31,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 16 [2024-05-08 02:51:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 131 proven. 25 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:51:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844472597] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:31,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2024-05-08 02:51:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121302977] [2024-05-08 02:51:31,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:31,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:51:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:51:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:51:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:31,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:31,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.296296296296296) internal successors, (413), 27 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:51:31,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-05-08 02:51:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-08 02:51:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:51:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:51:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:51:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:51:31,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2024-05-08 02:51:32,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:32,045 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2024-05-08 02:51:32,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 855758243, now seen corresponding path program 1 times [2024-05-08 02:51:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808528166] [2024-05-08 02:51:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:51:32,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:51:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:51:32,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:51:32,134 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2024-05-08 02:51:32,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2024-05-08 02:51:32,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-08 02:51:32,137 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-08 02:51:32,138 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:51:32,138 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-05-08 02:51:32,171 INFO L144 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-05-08 02:51:32,174 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:51:32,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:51:32,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:32,188 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:51:32,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (46)] Waiting until timeout for monitored process [2024-05-08 02:51:32,199 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:51:32,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:32,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:51:32,200 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:51:32,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-05-08 02:51:32,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:32,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:32,374 INFO L85 PathProgramCache]: Analyzing trace with hash 141764636, now seen corresponding path program 1 times [2024-05-08 02:51:32,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:32,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954469029] [2024-05-08 02:51:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-05-08 02:51:32,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954469029] [2024-05-08 02:51:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954469029] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:51:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:51:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:51:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091163523] [2024-05-08 02:51:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:51:32,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:51:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:51:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:51:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:32,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:32,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:32,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-08 02:51:32,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:32,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1987018939, now seen corresponding path program 1 times [2024-05-08 02:51:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776566835] [2024-05-08 02:51:32,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:32,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776566835] [2024-05-08 02:51:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776566835] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514185205] [2024-05-08 02:51:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:32,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:32,959 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:32,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-05-08 02:51:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:33,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:51:33,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:33,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514185205] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:33,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:51:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820746769] [2024-05-08 02:51:33,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:51:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:51:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:51:33,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:33,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:33,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:33,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:33,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:33,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:33,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,47 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:33,823 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:33,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1310761317, now seen corresponding path program 2 times [2024-05-08 02:51:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:33,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181910746] [2024-05-08 02:51:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181910746] [2024-05-08 02:51:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181910746] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928713967] [2024-05-08 02:51:33,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:51:33,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:33,971 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:33,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-05-08 02:51:34,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:51:34,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:51:34,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:51:34,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:34,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:34,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928713967] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:34,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:34,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:51:34,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006439806] [2024-05-08 02:51:34,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:34,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:51:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:51:34,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:51:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:34,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:34,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:34,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:34,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:34,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:34,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:35,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,48 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:35,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:35,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1531866533, now seen corresponding path program 3 times [2024-05-08 02:51:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918517710] [2024-05-08 02:51:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918517710] [2024-05-08 02:51:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918517710] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534829751] [2024-05-08 02:51:35,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:51:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:35,436 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:35,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-05-08 02:51:39,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-08 02:51:39,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:51:39,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 67 conjunts are in the unsatisfiable core [2024-05-08 02:51:39,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:39,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:39,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:39,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:51:39,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:51:39,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-08 02:51:39,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 11 [2024-05-08 02:51:40,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:51:41,092 INFO L349 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2024-05-08 02:51:41,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 27 [2024-05-08 02:51:41,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:41,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-08 02:51:41,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:41,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-08 02:51:41,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:41,334 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-05-08 02:51:41,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 36 [2024-05-08 02:51:41,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:41,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2024-05-08 02:51:41,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:51:41,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2024-05-08 02:51:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 191 proven. 35 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-05-08 02:51:41,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:42,600 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2024-05-08 02:51:42,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 58 [2024-05-08 02:51:42,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:42,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 115 treesize of output 131 [2024-05-08 02:51:42,621 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 94 treesize of output 90 [2024-05-08 02:51:42,627 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 86 treesize of output 78 [2024-05-08 02:51:42,655 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 8 treesize of output 4 [2024-05-08 02:51:42,677 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 8 treesize of output 4 [2024-05-08 02:51:42,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:42,717 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 81 treesize of output 85 [2024-05-08 02:51:44,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:44,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:51:44,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:51:44,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 [2024-05-08 02:51:44,568 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 22 treesize of output 18 [2024-05-08 02:51:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 157 proven. 69 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-05-08 02:51:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534829751] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:44,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 23] total 59 [2024-05-08 02:51:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478988862] [2024-05-08 02:51:44,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:44,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-05-08 02:51:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-05-08 02:51:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2997, Unknown=19, NotChecked=0, Total=3422 [2024-05-08 02:51:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:44,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:44,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 13.779661016949152) internal successors, (813), 59 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:44,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 02:51:47,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2024-05-08 02:51:47,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2024-05-08 02:51:47,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:47,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 788582943, now seen corresponding path program 1 times [2024-05-08 02:51:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971573946] [2024-05-08 02:51:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:47,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:47,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971573946] [2024-05-08 02:51:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971573946] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:47,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525527609] [2024-05-08 02:51:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:47,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:47,689 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:47,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-05-08 02:51:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:48,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 02:51:48,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:48,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-05-08 02:51:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525527609] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:48,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:48,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 02:51:48,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186003547] [2024-05-08 02:51:48,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:48,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 02:51:48,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 02:51:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 02:51:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:48,483 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:48,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.173913043478262) internal successors, (280), 23 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-08 02:51:48,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-05-08 02:51:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:48,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2024-05-08 02:51:49,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2024-05-08 02:51:49,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:49,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:49,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1166815295, now seen corresponding path program 2 times [2024-05-08 02:51:49,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:49,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111555547] [2024-05-08 02:51:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:49,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-05-08 02:51:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:50,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111555547] [2024-05-08 02:51:50,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111555547] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:51:50,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:51:50,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-05-08 02:51:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780206250] [2024-05-08 02:51:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:51:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-05-08 02:51:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:50,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-05-08 02:51:50,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-05-08 02:51:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:50,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:50,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.071428571428573) internal successors, (281), 14 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-05-08 02:51:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:50,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-08 02:51:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:51:51,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-08 02:51:51,127 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:51,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2135733999, now seen corresponding path program 1 times [2024-05-08 02:51:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426833075] [2024-05-08 02:51:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 171 proven. 10 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-05-08 02:51:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426833075] [2024-05-08 02:51:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426833075] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238534949] [2024-05-08 02:51:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:52,215 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:52,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-05-08 02:51:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:52,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:51:52,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:52,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-05-08 02:51:52,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:53,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:51:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 171 proven. 5 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-05-08 02:51:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238534949] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:53,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:53,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 29 [2024-05-08 02:51:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901210305] [2024-05-08 02:51:53,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:53,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-08 02:51:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-08 02:51:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2024-05-08 02:51:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:53,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:53,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 14.724137931034482) internal successors, (427), 29 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:51:53,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-08 02:51:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:51:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:51:55,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:55,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2024-05-08 02:51:55,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:55,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1152550354, now seen corresponding path program 1 times [2024-05-08 02:51:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639689903] [2024-05-08 02:51:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-05-08 02:51:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639689903] [2024-05-08 02:51:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639689903] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388350209] [2024-05-08 02:51:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:56,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:56,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:56,014 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:56,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-05-08 02:51:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:56,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:51:56,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:51:56,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:51:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 200 proven. 10 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-05-08 02:51:56,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:51:56,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 16 [2024-05-08 02:51:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 195 proven. 15 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-05-08 02:51:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388350209] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:51:57,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:51:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2024-05-08 02:51:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29238482] [2024-05-08 02:51:57,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:51:57,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-08 02:51:57,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:51:57,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-08 02:51:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2024-05-08 02:51:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:57,477 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:51:57,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 18.346153846153847) internal successors, (477), 26 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:51:57,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:51:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:51:58,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2024-05-08 02:51:59,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2024-05-08 02:51:59,098 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:51:59,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:51:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1828277365, now seen corresponding path program 1 times [2024-05-08 02:51:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:51:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845658873] [2024-05-08 02:51:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:51:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:51:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 144 proven. 96 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-05-08 02:51:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:51:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845658873] [2024-05-08 02:51:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845658873] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:51:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290521167] [2024-05-08 02:51:59,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:51:59,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:51:59,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:51:59,926 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:51:59,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2024-05-08 02:52:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:00,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:52:00,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:00,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:52:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 125 proven. 5 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-05-08 02:52:00,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:52:00,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:52:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 125 proven. 5 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-05-08 02:52:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290521167] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:52:01,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:52:01,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 9] total 36 [2024-05-08 02:52:01,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940875242] [2024-05-08 02:52:01,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:52:01,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-08 02:52:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:52:01,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-08 02:52:01,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2024-05-08 02:52:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:01,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:52:01,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 15.5) internal successors, (558), 36 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:52:01,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:01,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:01,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:01,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:01,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:01,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:01,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:01,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:01,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:02,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2024-05-08 02:52:02,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,53 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:02,905 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:52:02,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:52:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1168848476, now seen corresponding path program 1 times [2024-05-08 02:52:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:52:02,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370154167] [2024-05-08 02:52:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:52:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 195 proven. 20 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-08 02:52:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:52:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370154167] [2024-05-08 02:52:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370154167] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:52:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227342026] [2024-05-08 02:52:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:03,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:03,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:52:03,420 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:52:03,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2024-05-08 02:52:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:03,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 28 conjunts are in the unsatisfiable core [2024-05-08 02:52:03,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:04,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:52:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 170 proven. 45 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-08 02:52:04,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:52:04,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:52:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 195 proven. 20 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-08 02:52:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227342026] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:52:04,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:52:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-08 02:52:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037341714] [2024-05-08 02:52:04,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:52:04,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:52:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:52:04,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:52:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:52:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:04,539 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:52:04,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.62962962962963) internal successors, (449), 27 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:52:04,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:04,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:04,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:04,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:04,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:04,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-05-08 02:52:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:05,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2024-05-08 02:52:05,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,54 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:05,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:52:05,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:52:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1758158926, now seen corresponding path program 1 times [2024-05-08 02:52:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:52:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162312696] [2024-05-08 02:52:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:52:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 164 proven. 66 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:52:06,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:52:06,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162312696] [2024-05-08 02:52:06,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162312696] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:52:06,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070637279] [2024-05-08 02:52:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:06,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:06,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:52:06,723 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:52:06,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2024-05-08 02:52:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:07,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-08 02:52:07,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:52:08,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:52:08,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-08 02:52:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 191 proven. 39 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-05-08 02:52:08,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:52:20,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:52:20,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-08 02:52:20,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:52:20,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 30 [2024-05-08 02:52:20,761 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 8 treesize of output 4 [2024-05-08 02:52:20,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:52:20,770 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 24 treesize of output 24 [2024-05-08 02:52:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 35 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:52:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070637279] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:52:21,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:52:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 12] total 42 [2024-05-08 02:52:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521276161] [2024-05-08 02:52:21,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:52:21,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-08 02:52:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:52:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-08 02:52:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1534, Unknown=6, NotChecked=0, Total=1722 [2024-05-08 02:52:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:21,205 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:52:21,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 12.095238095238095) internal successors, (508), 42 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:21,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-08 02:52:22,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:22,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2024-05-08 02:52:23,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,55 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:23,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:52:23,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:52:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1512932875, now seen corresponding path program 1 times [2024-05-08 02:52:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:52:23,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299561401] [2024-05-08 02:52:23,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:52:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 105 proven. 130 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:52:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:52:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299561401] [2024-05-08 02:52:23,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299561401] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:52:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278967400] [2024-05-08 02:52:23,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:52:23,756 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:52:23,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-05-08 02:52:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:24,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 41 conjunts are in the unsatisfiable core [2024-05-08 02:52:24,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:25,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:52:25,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:52:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-08 02:52:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 137 proven. 98 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-05-08 02:52:25,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:52:37,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:52:37,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-08 02:52:37,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:52:37,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 30 [2024-05-08 02:52:37,989 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 8 treesize of output 4 [2024-05-08 02:52:37,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:52:37,999 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 24 treesize of output 24 [2024-05-08 02:52:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 160 proven. 65 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:52:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278967400] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:52:38,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:52:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 12] total 42 [2024-05-08 02:52:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206065530] [2024-05-08 02:52:38,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:52:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-08 02:52:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:52:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-08 02:52:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1532, Unknown=6, NotChecked=0, Total=1722 [2024-05-08 02:52:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:38,375 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:52:38,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 13.19047619047619) internal successors, (554), 42 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:38,376 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:39,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2024-05-08 02:52:39,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2024-05-08 02:52:39,674 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:52:39,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:52:39,674 INFO L85 PathProgramCache]: Analyzing trace with hash 595562646, now seen corresponding path program 1 times [2024-05-08 02:52:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:52:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195062144] [2024-05-08 02:52:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:52:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 35 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:52:40,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:52:40,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195062144] [2024-05-08 02:52:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195062144] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:52:40,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609244946] [2024-05-08 02:52:40,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:40,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:40,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:52:40,085 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:52:40,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-05-08 02:52:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:40,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 32 conjunts are in the unsatisfiable core [2024-05-08 02:52:40,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:41,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:52:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 145 proven. 75 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:52:41,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:52:41,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:52:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 35 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:52:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609244946] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:52:41,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:52:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 27 [2024-05-08 02:52:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331773862] [2024-05-08 02:52:41,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:52:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:52:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:52:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:52:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:52:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:41,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:52:41,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.962962962962964) internal successors, (431), 27 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:41,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-08 02:52:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:52:42,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2024-05-08 02:52:42,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,57 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:42,836 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:52:42,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:52:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1135005866, now seen corresponding path program 1 times [2024-05-08 02:52:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:52:42,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735679236] [2024-05-08 02:52:42,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:42,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:52:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 5 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-05-08 02:52:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:52:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735679236] [2024-05-08 02:52:43,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735679236] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:52:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530090855] [2024-05-08 02:52:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:43,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:43,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:52:43,261 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:52:43,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-05-08 02:52:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:43,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-08 02:52:43,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:44,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:52:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 175 proven. 50 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:52:44,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:52:44,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 12 [2024-05-08 02:52:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 185 proven. 40 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:52:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530090855] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:52:44,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:52:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2024-05-08 02:52:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947290059] [2024-05-08 02:52:44,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:52:44,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-08 02:52:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:52:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-08 02:52:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-05-08 02:52:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:44,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:52:44,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.962962962962962) internal successors, (458), 27 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:44,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:52:44,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:52:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:52:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:52:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:52:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-08 02:52:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:52:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:52:45,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2024-05-08 02:52:46,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,58 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:46,066 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:52:46,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:52:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 924656902, now seen corresponding path program 1 times [2024-05-08 02:52:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:52:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391856399] [2024-05-08 02:52:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:52:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 154 proven. 66 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:52:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:52:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391856399] [2024-05-08 02:52:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391856399] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:52:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782896237] [2024-05-08 02:52:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:52:46,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:52:46,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:52:46,636 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:52:46,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-05-08 02:52:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:52:47,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-08 02:52:47,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:52:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:52:48,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:52:48,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-08 02:52:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 154 proven. 66 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:52:48,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:53:00,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:53:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-08 02:53:00,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:53:00,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 30 [2024-05-08 02:53:00,607 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 8 treesize of output 4 [2024-05-08 02:53:00,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:53:00,616 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 24 treesize of output 24 [2024-05-08 02:53:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 165 proven. 50 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2024-05-08 02:53:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782896237] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:53:00,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:53:00,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 12] total 41 [2024-05-08 02:53:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727453633] [2024-05-08 02:53:00,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:53:00,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-08 02:53:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:53:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-08 02:53:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1433, Unknown=6, NotChecked=0, Total=1640 [2024-05-08 02:53:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:00,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:53:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.75609756097561) internal successors, (482), 41 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:53:00,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:53:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:02,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2024-05-08 02:53:02,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2024-05-08 02:53:02,522 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:53:02,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1299871125, now seen corresponding path program 1 times [2024-05-08 02:53:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:53:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430423913] [2024-05-08 02:53:02,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:53:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 100 proven. 125 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:53:03,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:53:03,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430423913] [2024-05-08 02:53:03,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430423913] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:53:03,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976097733] [2024-05-08 02:53:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:03,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:53:03,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:53:03,309 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:53:03,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-05-08 02:53:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:03,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 44 conjunts are in the unsatisfiable core [2024-05-08 02:53:03,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:53:04,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:53:04,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:04,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-05-08 02:53:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 100 proven. 125 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-05-08 02:53:05,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:53:17,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:53:17,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-05-08 02:53:17,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:53:17,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 30 [2024-05-08 02:53:17,543 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 8 treesize of output 4 [2024-05-08 02:53:17,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:53:17,553 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 24 treesize of output 24 [2024-05-08 02:53:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 126 proven. 94 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-05-08 02:53:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976097733] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:53:17,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:53:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 12] total 41 [2024-05-08 02:53:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577657796] [2024-05-08 02:53:17,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:53:17,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-08 02:53:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:53:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-08 02:53:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1432, Unknown=6, NotChecked=0, Total=1640 [2024-05-08 02:53:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:18,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:53:18,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 12.829268292682928) internal successors, (526), 41 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:18,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-08 02:53:19,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2024-05-08 02:53:19,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2024-05-08 02:53:19,273 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2024-05-08 02:53:19,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash 260589196, now seen corresponding path program 1 times [2024-05-08 02:53:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:53:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540608893] [2024-05-08 02:53:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:53:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:53:19,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-08 02:53:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-08 02:53:19,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-08 02:53:19,374 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-05-08 02:53:19,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2024-05-08 02:53:19,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-05-08 02:53:19,376 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-08 02:53:19,376 WARN L233 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-08 02:53:19,376 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-05-08 02:53:19,421 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-05-08 02:53:19,425 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-08 02:53:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-08 02:53:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:53:19,442 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-08 02:53:19,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (61)] Waiting until timeout for monitored process [2024-05-08 02:53:19,459 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-08 02:53:19,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:19,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-08 02:53:19,459 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;@50c4f798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-08 02:53:19,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-05-08 02:53:19,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 02:53:19,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash -857728578, now seen corresponding path program 1 times [2024-05-08 02:53:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:53:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030065493] [2024-05-08 02:53:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:53:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-05-08 02:53:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:53:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030065493] [2024-05-08 02:53:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030065493] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 02:53:19,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 02:53:19,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-08 02:53:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588110121] [2024-05-08 02:53:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 02:53:19,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-08 02:53:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:53:20,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-08 02:53:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-08 02:53:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:20,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:53:20,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:53:20,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:20,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-05-08 02:53:20,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 02:53:20,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash -56031683, now seen corresponding path program 1 times [2024-05-08 02:53:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:53:20,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896495501] [2024-05-08 02:53:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:53:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:53:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896495501] [2024-05-08 02:53:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896495501] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:53:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313343870] [2024-05-08 02:53:20,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:20,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:53:20,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:53:20,560 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:53:20,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-05-08 02:53:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:21,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-08 02:53:21,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:53:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:21,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:53:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313343870] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:53:21,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:53:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-08 02:53:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960118680] [2024-05-08 02:53:21,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:53:21,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-08 02:53:21,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:53:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-08 02:53:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-08 02:53:21,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:21,310 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:53:21,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.1) internal successors, (291), 10 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:53:21,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:21,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:21,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2024-05-08 02:53:21,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,62 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:53:21,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 02:53:21,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1251200323, now seen corresponding path program 2 times [2024-05-08 02:53:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:53:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616113126] [2024-05-08 02:53:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:53:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:53:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616113126] [2024-05-08 02:53:21,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616113126] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:53:21,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720056977] [2024-05-08 02:53:21,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-08 02:53:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:53:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:53:21,886 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:53:21,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-05-08 02:53:22,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-08 02:53:22,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:53:22,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-08 02:53:22,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:53:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:22,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:53:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720056977] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:53:22,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:53:22,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-05-08 02:53:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450184002] [2024-05-08 02:53:22,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:53:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-05-08 02:53:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:53:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-05-08 02:53:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-05-08 02:53:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:22,826 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:53:22,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.27777777777778) internal successors, (311), 18 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:53:22,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:22,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:22,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:53:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:53:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:53:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:53:23,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2024-05-08 02:53:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,63 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:53:23,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 02:53:23,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 02:53:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1485722691, now seen corresponding path program 3 times [2024-05-08 02:53:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 02:53:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983605253] [2024-05-08 02:53:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 02:53:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 02:53:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 02:53:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 02:53:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 02:53:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983605253] [2024-05-08 02:53:23,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983605253] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 02:53:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880249755] [2024-05-08 02:53:23,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-08 02:53:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 02:53:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 02:53:23,659 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 02:53:23,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2024-05-08 02:53:26,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-05-08 02:53:26,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-08 02:53:26,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 122 conjunts are in the unsatisfiable core [2024-05-08 02:53:26,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 02:53:27,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-05-08 02:53:27,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:27,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:53:27,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:27,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-05-08 02:53:27,410 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-08 02:53:27,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 11 [2024-05-08 02:53:28,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-05-08 02:53:28,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:28,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 23 [2024-05-08 02:53:28,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:28,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-08 02:53:28,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:28,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-05-08 02:53:28,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:28,816 INFO L349 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2024-05-08 02:53:28,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 30 treesize of output 48 [2024-05-08 02:53:29,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:29,149 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-05-08 02:53:29,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 68 treesize of output 62 [2024-05-08 02:53:29,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:29,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2024-05-08 02:53:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:29,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 23 [2024-05-08 02:53:30,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:30,521 INFO L349 Elim1Store]: treesize reduction 42, result has 37.3 percent of original size [2024-05-08 02:53:30,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 43 [2024-05-08 02:53:34,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:34,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-05-08 02:53:35,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:35,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-05-08 02:53:35,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:35,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:35,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:35,275 INFO L349 Elim1Store]: treesize reduction 40, result has 48.7 percent of original size [2024-05-08 02:53:35,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 56 [2024-05-08 02:53:36,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:36,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 130 [2024-05-08 02:53:36,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:36,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 130 [2024-05-08 02:53:38,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:38,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:38,108 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2024-05-08 02:53:38,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2024-05-08 02:53:38,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:38,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:38,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:39,016 INFO L349 Elim1Store]: treesize reduction 64, result has 37.3 percent of original size [2024-05-08 02:53:39,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 59 [2024-05-08 02:53:45,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-05-08 02:53:45,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2024-05-08 02:53:45,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:45,718 INFO L349 Elim1Store]: treesize reduction 42, result has 48.8 percent of original size [2024-05-08 02:53:45,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 68 [2024-05-08 02:53:46,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:46,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 167 [2024-05-08 02:53:47,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:53:47,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 167 [2024-05-08 02:53:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 157 proven. 170 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-05-08 02:53:48,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 02:53:48,887 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7240 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) (+ (* |c_t_funThread8of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) 0))) is different from false [2024-05-08 02:53:49,955 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse0 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse1 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse3 (store .cse0 .cse1 1)) (.cse4 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse3 .cse4 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0)) (not (= (select .cse3 .cse4) 0)))))) is different from false [2024-05-08 02:53:50,101 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse5 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0)))) (let ((.cse2 (select (store .cse5 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse0 (store .cse2 .cse3 1)) (.cse1 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select (select (store (let ((.cse4 (store .cse5 |c_~#cache~0.base| (store .cse0 .cse1 1)))) (store .cse4 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse4 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))))))) is different from false [2024-05-08 02:53:50,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse5 (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0)))) (let ((.cse2 (select (store .cse5 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse0 (store .cse2 .cse3 1)) (.cse1 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select (select (store (let ((.cse4 (store .cse5 |c_~#cache~0.base| (store .cse0 .cse1 1)))) (store .cse4 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse4 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) (+ |c_~#cache~0.offset| 4)) 0))))))) is different from false [2024-05-08 02:53:52,904 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse7 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|)) (.cse8 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse5 (store .cse7 .cse8 1)) (.cse6 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse10 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse5 .cse6 1)))) (let ((.cse1 (store (select (store .cse10 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse9 (select (store (store .cse10 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse1) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse4 (+ |c_~#cache~0.offset| 4))) (let ((.cse2 (store .cse9 .cse4 1)) (.cse3 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse0 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse1) |c_~#cache~0.base| (store .cse2 .cse3 1)))) (store .cse0 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse0 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse4) 0)) (not (= (select .cse5 .cse6) 0)) (not (= (select .cse7 .cse8) 0)) (not (= (select .cse9 .cse4) 0)) (not (= (select .cse2 .cse3) 0)))))))))) is different from false [2024-05-08 02:53:53,450 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse3 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0)))) (let ((.cse0 (select (store .cse3 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|)) (.cse1 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse9 (store .cse0 .cse1 1)) (.cse10 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse11 (store .cse3 |c_~#cache~0.base| (store .cse9 .cse10 1)))) (let ((.cse4 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse8 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse4) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse7 (+ |c_~#cache~0.offset| 4))) (let ((.cse5 (store .cse8 .cse7 1)) (.cse6 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store (store .cse3 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse4) |c_~#cache~0.base| (store .cse5 .cse6 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse7) 0)) (not (= (select .cse8 .cse7) 0)) (not (= (select .cse9 .cse10) 0)) (not (= (select .cse5 .cse6) 0))))))))))) is different from false [2024-05-08 02:53:53,761 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse5 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0)))) (let ((.cse2 (select (store .cse5 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|)) (.cse3 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (let ((.cse9 (store .cse2 .cse3 1)) (.cse10 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse9 .cse10 1)))) (let ((.cse6 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse0 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse6) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|)) (.cse1 (+ |c_~#cache~0.offset| 4))) (let ((.cse7 (store .cse0 .cse1 1)) (.cse8 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse2 .cse3) 0)) (not (= (select (select (store (let ((.cse4 (store (store .cse5 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse6) |c_~#cache~0.base| (store .cse7 .cse8 1)))) (store .cse4 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse4 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse1) 0)) (not (= (select .cse7 .cse8) 0)) (not (= (select .cse9 .cse10) 0))))))))))) is different from false [2024-05-08 02:53:58,783 INFO L349 Elim1Store]: treesize reduction 54, result has 43.2 percent of original size [2024-05-08 02:53:58,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1912 treesize of output 760 [2024-05-08 02:54:01,459 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-05-08 02:54:01,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 3890 treesize of output 3747 [2024-05-08 02:54:02,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:54:02,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3275838 treesize of output 3252904 [2024-05-08 02:54:03,461 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 11018 treesize of output 10506 [2024-05-08 02:54:03,985 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-08 02:54:03,986 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 10603 treesize of output 10539 [2024-05-08 02:54:04,199 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-05-08 02:54:04,200 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 11606 treesize of output 11498 [2024-05-08 02:54:04,556 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 8044 treesize of output 7788 [2024-05-08 02:54:04,759 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-08 02:54:04,760 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 192 treesize of output 176 [2024-05-08 02:54:04,954 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-08 02:54:04,955 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 1420 treesize of output 1356 [2024-05-08 02:54:07,515 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 8 treesize of output 4 [2024-05-08 02:54:07,546 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 8 treesize of output 4 [2024-05-08 02:54:07,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:54:07,575 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 21 treesize of output 21 [2024-05-08 02:54:08,053 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 8 treesize of output 4 [2024-05-08 02:54:09,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:54:09,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 1049 treesize of output 2005 [2024-05-08 02:57:19,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:57:19,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:57:19,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:57:19,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 31 [2024-05-08 02:57:19,811 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 8 treesize of output 4 [2024-05-08 02:57:19,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-08 02:57:19,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-05-08 02:57:19,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-08 02:57:19,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 13 [2024-05-08 02:57:20,090 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 110 proven. 200 refuted. 5 times theorem prover too weak. 142 trivial. 2 not checked. [2024-05-08 02:57:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880249755] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 02:57:20,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 02:57:20,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 42, 39] total 94 [2024-05-08 02:57:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722039360] [2024-05-08 02:57:20,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 02:57:20,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-05-08 02:57:20,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 02:57:20,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-05-08 02:57:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=6707, Unknown=66, NotChecked=1232, Total=8742 [2024-05-08 02:57:20,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:57:20,340 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 02:57:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 10.606382978723405) internal successors, (997), 94 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 02:57:20,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 02:57:20,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 02:57:20,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 02:57:20,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 02:57:33,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:35,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:38,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:40,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:42,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:44,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:46,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:49,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:51,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:53,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:55,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:57,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:57:59,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:01,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:05,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:07,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:16,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:19,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:21,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:23,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:25,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:27,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:29,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:32,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:34,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:37,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:40,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:42,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:45,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:52,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:54,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:56,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:58:58,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:59:00,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:59:02,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 02:59:07,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:10,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:13,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:16,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:18,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:21,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:23,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:26,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:29,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 02:59:32,161 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#pthreadsMutex| 4))) (let ((.cse44 (select .cse10 4))) (let ((.cse8 (= .cse44 0)) (.cse7 (exists ((|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1)))) (.cse9 (= .cse44 1)) (.cse17 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse6 (+ |c_~#cache~0.offset| 4)) (.cse1 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse20 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (and (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse0 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse0 .cse1 1)) (.cse5 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse4 .cse5) 0)))))) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (or (and .cse7 (or .cse8 (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)) .cse9))) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (<= 28 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset|))) .cse9)) (or (and .cse9 (let ((.cse11 (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)))))) (or (and .cse11 .cse7) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|))))) (and .cse11 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))))))) (and .cse8 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (= |c_t_funThread6of8ForFork0_~i~0#1| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse18 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse19 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse17 .cse18 1)))) (let ((.cse13 (store (select (store .cse19 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))) (let ((.cse16 (select (store (store .cse19 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse13) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse14 (store .cse16 .cse1 1)) (.cse15 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse12 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse13) |c_~#cache~0.base| (store .cse14 .cse15 1)))) (store .cse12 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse12 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse14 .cse15) 0)) (not (= 0 (select .cse16 .cse1))) (not (= (select .cse17 .cse18) 0))))))))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)) (or (and (or .cse8 .cse9) .cse7) (and (exists ((v_prenex_3 Int)) (and (= (select .cse10 (+ v_prenex_3 4)) 0) (<= 28 v_prenex_3))) .cse9)) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 0 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| 4) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse27 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse28 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse25 (let ((.cse26 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse27 .cse28 1)))) (store .cse26 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse26 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))))) (let ((.cse23 (select (store .cse25 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse21 (store .cse23 .cse1 1)) (.cse22 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse21 .cse22) 0)) (not (= (select .cse23 .cse1) 0)) (not (= (select (select (store (let ((.cse24 (store .cse25 |c_~#cache~0.base| (store .cse21 .cse22 1)))) (store .cse24 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse24 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (not (= (select .cse27 .cse28) 0))))) (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread5of8ForFork0_~i~0#1| 0) (= |c_t_funThread3of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse34 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse35 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse17 .cse34 1)))) (let ((.cse33 (store (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))) (let ((.cse29 (select (store (store .cse35 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse30 (store .cse29 .cse6 1)) (.cse31 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse29 .cse6) 0)) (not (= (select .cse30 .cse31) 0)) (not (= (select (select (store (let ((.cse32 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#cache~0.base| (store .cse30 .cse31 1)))) (store .cse32 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse17 .cse34) 0))))))))) (= |c_~#cache~0.offset| 0) (<= 1 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread7of8ForFork0_~i~0#1| 0) (<= |c_~#__global_lock~0.base| 3) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse41 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse42 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse37 (let ((.cse43 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse41 .cse42 1)))) (store .cse43 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse43 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))))) (let ((.cse40 (select (store .cse37 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse38 (store .cse40 .cse1 1)) (.cse39 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse36 (store .cse37 |c_~#cache~0.base| (store .cse38 .cse39 1)))) (store .cse36 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse40 .cse1) 0)) (not (= (select .cse38 .cse39) 0)) (not (= (select .cse41 .cse42) 0)))))))) (= |c_~#cache~0.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| 4))))) is different from false [2024-05-08 02:59:34,563 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#pthreadsMutex| 4))) (let ((.cse44 (select .cse10 4))) (let ((.cse8 (= .cse44 0)) (.cse7 (exists ((|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1)))) (.cse9 (= .cse44 1)) (.cse17 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse6 (+ |c_~#cache~0.offset| 4)) (.cse1 (+ (* |c_t_funThread7of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse20 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (and (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse0 (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse0 .cse1 1)) (.cse5 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (store (let ((.cse2 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse2 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse2 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse4 .cse5) 0)))))) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (or (and .cse7 (or .cse8 (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)) .cse9))) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (<= 28 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset|))) .cse9)) (or (and .cse9 (let ((.cse11 (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)))))) (or (and .cse11 .cse7) (and (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (exists ((|t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (<= 28 |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|))))) (and .cse11 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))))))) (and .cse8 (exists ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (|t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (and (= (select .cse10 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1) (not (= |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|)) (<= 28 |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse10 (+ |t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 1))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (= |c_t_funThread6of8ForFork0_~i~0#1| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse18 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse19 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse17 .cse18 1)))) (let ((.cse13 (store (select (store .cse19 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))) (let ((.cse16 (select (store (store .cse19 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse13) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse14 (store .cse16 .cse1 1)) (.cse15 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse12 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse13) |c_~#cache~0.base| (store .cse14 .cse15 1)))) (store .cse12 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse12 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse14 .cse15) 0)) (not (= 0 (select .cse16 .cse1))) (not (= (select .cse17 .cse18) 0))))))))) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset|)) (or (and (or .cse8 .cse9) .cse7) (and (exists ((v_prenex_3 Int)) (and (= (select .cse10 (+ v_prenex_3 4)) 0) (<= 28 v_prenex_3))) .cse9)) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 0 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| 4) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (let ((.cse27 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse28 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse25 (let ((.cse26 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse27 .cse28 1)))) (store .cse26 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse26 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))))) (let ((.cse23 (select (store .cse25 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse21 (store .cse23 .cse1 1)) (.cse22 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse21 .cse22) 0)) (not (= (select .cse23 .cse1) 0)) (not (= (select (select (store (let ((.cse24 (store .cse25 |c_~#cache~0.base| (store .cse21 .cse22 1)))) (store .cse24 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse24 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0))))))) (not (= (select .cse27 .cse28) 0))))) (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread5of8ForFork0_~i~0#1| 0) (= |c_t_funThread3of8ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse34 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse35 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse17 .cse34 1)))) (let ((.cse33 (store (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))) (let ((.cse29 (select (store (store .cse35 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse30 (store .cse29 .cse6 1)) (.cse31 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse29 .cse6) 0)) (not (= (select .cse30 .cse31) 0)) (not (= (select (select (store (let ((.cse32 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#cache~0.base| (store .cse30 .cse31 1)))) (store .cse32 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse17 .cse34) 0))))))))) (= |c_~#cache~0.offset| 0) (<= 1 |c_t_funThread1of8ForFork0_~i~0#1|) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread7of8ForFork0_~i~0#1| 0) (<= |c_~#__global_lock~0.base| 3) (= |c_t_funThread5of8ForFork0_cache_entry_addref_~entry#1.offset| 0) (= |c_t_funThread5of8ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse41 (select |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse42 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse37 (let ((.cse43 (store |c_#pthreadsMutex| |c_t_funThread2of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse41 .cse42 1)))) (store .cse43 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse43 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse20 0))))) (let ((.cse40 (select (store .cse37 |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse38 (store .cse40 .cse1 1)) (.cse39 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse36 (store .cse37 |c_~#cache~0.base| (store .cse38 .cse39 1)))) (store .cse36 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse6) 0)) (not (= (select .cse40 .cse1) 0)) (not (= (select .cse38 .cse39) 0)) (not (= (select .cse41 .cse42) 0)))))))) (= |c_~#cache~0.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| 4))))) is different from true [2024-05-08 02:59:48,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 02:59:50,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:04,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:06,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:08,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:10,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:12,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:14,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-05-08 03:00:17,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:21,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:24,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:26,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:35,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:38,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:40,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:42,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:45,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:47,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:50,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:55,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:57,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:00:59,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:01,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:04,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:06,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:08,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:10,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:12,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:15,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:18,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:20,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:22,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-05-08 03:01:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 03:01:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 03:01:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:01:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-08 03:01:37,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2024-05-08 03:01:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,64 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:01:37,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 03:01:37,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:01:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1428148498, now seen corresponding path program 1 times [2024-05-08 03:01:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:01:37,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316855632] [2024-05-08 03:01:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:01:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:01:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:01:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 03:01:38,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:01:38,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316855632] [2024-05-08 03:01:38,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316855632] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-08 03:01:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415683138] [2024-05-08 03:01:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:01:38,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:01:38,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-08 03:01:38,579 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-08 03:01:38,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-05-08 03:01:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:01:39,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-08 03:01:39,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-08 03:01:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 03:01:39,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-08 03:01:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-05-08 03:01:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415683138] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-08 03:01:40,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-08 03:01:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-05-08 03:01:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164541298] [2024-05-08 03:01:40,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-08 03:01:40,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-08 03:01:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:01:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-08 03:01:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-05-08 03:01:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:01:40,259 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:01:40,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.08695652173913) internal successors, (324), 23 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:01:40,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 03:01:40,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 03:01:40,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:01:40,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-08 03:01:40,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:01:41,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 03:01:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 03:01:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:01:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-05-08 03:01:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 03:01:41,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2024-05-08 03:01:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,65 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-08 03:01:41,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 03:01:41,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:01:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 106181778, now seen corresponding path program 2 times [2024-05-08 03:01:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:01:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745556878] [2024-05-08 03:01:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:01:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:01:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:01:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-05-08 03:01:42,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:01:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745556878] [2024-05-08 03:01:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745556878] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 03:01:42,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 03:01:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-08 03:01:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389343811] [2024-05-08 03:01:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 03:01:42,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-08 03:01:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:01:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-08 03:01:42,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-08 03:01:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:01:42,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:01:42,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.727272727272727) internal successors, (327), 11 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:01:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 03:01:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 03:01:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:01:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-05-08 03:01:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 03:01:42,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:01:43,698 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-05-08 03:01:43,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1234 treesize of output 1142 [2024-05-08 03:01:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash -448916208, now seen corresponding path program 1 times [2024-05-08 03:01:44,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:01:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:01:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:01:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-05-08 03:01:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:01:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:01:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:01:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-05-08 03:01:45,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-08 03:01:45,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-05-08 03:01:49,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:01:52,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:01:58,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:00,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:04,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:08,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-08 03:02:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-08 03:02:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:02:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-05-08 03:02:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-08 03:02:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-08 03:02:08,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76 [2024-05-08 03:02:08,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2024-05-08 03:02:08,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-08 03:02:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1321859505, now seen corresponding path program 1 times [2024-05-08 03:02:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-08 03:02:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059122990] [2024-05-08 03:02:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-08 03:02:08,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-08 03:02:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-08 03:02:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-05-08 03:02:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-08 03:02:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059122990] [2024-05-08 03:02:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059122990] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-08 03:02:09,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-08 03:02:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-08 03:02:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065464853] [2024-05-08 03:02:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-08 03:02:09,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-08 03:02:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-08 03:02:10,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-08 03:02:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-05-08 03:02:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:02:10,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-08 03:02:10,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.09090909090909) internal successors, (309), 11 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-08 03:02:10,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-08 03:02:12,910 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse12 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse14 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (+ |c_~#cache~0.offset| 4)) (.cse47 (select |c_#pthreadsMutex| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse13 (not (= |c_~#cache~0.base| |c_~#__global_lock~0.base|))) (.cse15 (not (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) (.cse16 (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|))) (.cse17 (not (= |c_~#cache~0.base| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|)))) (and (let ((.cse1 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse6 (store .cse0 .cse1 1)) (.cse7 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse11 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse6 .cse7 1)))) (let ((.cse10 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse2 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse2 .cse3 1)) (.cse5 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse2 .cse3) 0)) (not (= (select .cse4 .cse5) 0)) (not (= (select .cse6 .cse7) 0)) (not (= (select (select (store (let ((.cse8 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse8 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0))))))))))) (or .cse13 (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse0 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0)))) (or (not (= (select .cse14 .cse3) 0)) .cse15 .cse16 .cse17) (let ((.cse27 (select |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse28 (+ |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse19 (store |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse27 .cse28 1)))) (let ((.cse23 (select .cse19 |c_~#cache~0.base|)) (.cse24 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse26 (store .cse19 |c_~#cache~0.base| (store .cse23 .cse24 1)))) (let ((.cse20 (store (select (store .cse26 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse25 (select (store (store .cse26 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse20) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse21 (store .cse25 .cse3 1)) (.cse22 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse18 (store (store .cse19 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse20) |c_~#cache~0.base| (store .cse21 .cse22 1)))) (store .cse18 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse18 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse23 .cse24) 0)) (not (= 0 (select .cse21 .cse22))) (not (= 0 (select .cse25 .cse3))))))))))) (not (= (select .cse27 .cse28) 0)))) (or .cse15 .cse17 (forall ((v_ArrVal_7217 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) .cse3) 0)))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse34 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse35 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse0 .cse34 1)))) (let ((.cse33 (store (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse29 (select (store (store .cse35 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse30 (store .cse29 .cse3 1)) (.cse31 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse29 .cse3) 0)) (not (= (select .cse30 .cse31) 0)) (not (= (select (select (store (let ((.cse32 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse33) |c_~#cache~0.base| (store .cse30 .cse31 1)))) (store .cse32 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse0 .cse34) 0))))))))) (let ((.cse36 (select |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse37 (+ |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.offset| 4))) (or (not (= (select .cse36 .cse37) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse42 (store |c_#pthreadsMutex| |c_t_funThread6of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse36 .cse37 1)))) (let ((.cse44 (select .cse42 |c_~#cache~0.base|)) (.cse45 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse46 (store .cse42 |c_~#cache~0.base| (store .cse44 .cse45 1)))) (let ((.cse43 (store (select (store .cse46 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse38 (select (store (store .cse46 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse39 (store .cse38 .cse3 1)) (.cse40 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse38 .cse3) 0)) (not (= (select .cse39 .cse40) 0)) (not (= (select (select (store (let ((.cse41 (store (store .cse42 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse43) |c_~#cache~0.base| (store .cse39 .cse40 1)))) (store .cse41 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse41 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= 0 (select .cse44 .cse45))))))))))))) (= |c_~#cache~0.offset| 0) (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse14 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse13) (<= |c_~#__global_lock~0.base| 3) (or .cse15 .cse17 (not (= (select .cse0 .cse3) 0))) (or .cse15 (not (= (select .cse47 .cse3) 0)) (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_#in~entry#1.base|)) .cse17) (or (forall ((v_ArrVal_7217 (Array Int Int)) (|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_7217) |c_~#cache~0.base|) (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4))))) .cse13) .cse13 (or (forall ((|t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| Int)) (not (= (select .cse47 (+ |t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) 0))) .cse13) (= |c_~#cache~0.base| 4) (or .cse15 .cse16 (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) .cse17))) is different from true [2024-05-08 03:02:25,662 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse3 (+ |c_~#cache~0.offset| 4)) (.cse12 (+ |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| 4)) (.cse1 (+ (* |c_t_funThread6of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset| 4)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|))) (and (or (not (= (select .cse0 .cse1) 0)) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse6 (store .cse0 .cse1 1)) (.cse7 (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (let ((.cse11 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse6 .cse7 1)))) (let ((.cse10 (store (select (store .cse11 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse2 (select (store (store .cse11 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse4 (store .cse2 .cse3 1)) (.cse5 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse2 .cse3) 0)) (not (= (select .cse4 .cse5) 0)) (not (= (select .cse6 .cse7) 0)) (not (= (select (select (store (let ((.cse8 (store (store |c_#pthreadsMutex| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse10) |c_~#cache~0.base| (store .cse4 .cse5 1)))) (store .cse8 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse8 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)))))))))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (|v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse22 (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse23 (+ |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| 4))) (let ((.cse14 (let ((.cse25 (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse22 .cse23 1)))) (store .cse25 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse25 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))))) (let ((.cse20 (select (store .cse14 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse18 (store .cse20 .cse1 1)) (.cse19 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse24 (store .cse14 |c_~#cache~0.base| (store .cse18 .cse19 1)))) (let ((.cse15 (store (select (store .cse24 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse21 (select (store (store .cse24 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse15) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse16 (store .cse21 .cse3 1)) (.cse17 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select (select (store (let ((.cse13 (store (store .cse14 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse15) |c_~#cache~0.base| (store .cse16 .cse17 1)))) (store .cse13 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse13 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse18 .cse19) 0)) (< |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| |c_t_funThread1of8ForFork0_cache_entry_addref_#in~entry#1.offset|) (not (= (select .cse20 .cse1) 0)) (not (= (select .cse16 .cse17) 0)) (not (= (select .cse21 .cse3) 0)) (not (= (select .cse22 .cse23) 0)))))))))))) (let ((.cse37 (select |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base|)) (.cse38 (+ |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset| 4))) (or (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (v_ArrVal_7240 (Array Int Int))) (let ((.cse33 (let ((.cse36 (store |c_#pthreadsMutex| |c_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.base| (store .cse37 .cse38 1)))) (store .cse36 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse36 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))))) (let ((.cse29 (select (store .cse33 |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse30 (store .cse29 .cse1 1)) (.cse31 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse35 (store .cse33 |c_~#cache~0.base| (store .cse30 .cse31 1)))) (let ((.cse34 (store (select (store .cse35 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse26 (select (store (store .cse35 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse34) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse27 (store .cse26 .cse3 1)) (.cse28 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (not (= (select .cse26 .cse3) 0)) (not (= 0 (select .cse27 .cse28))) (not (= (select .cse29 .cse1) 0)) (not (= (select .cse30 .cse31) 0)) (not (= (select (select (store (let ((.cse32 (store (store .cse33 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse34) |c_~#cache~0.base| (store .cse27 .cse28 1)))) (store .cse32 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse32 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0))))))))))) (not (= (select .cse37 .cse38) 0)))) (forall ((|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_7221 (Array Int Int)) (v_ArrVal_7232 (Array Int Int)) (v_ArrVal_7224 (Array Int Int)) (|v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (|t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| Int) (v_ArrVal_7237 (Array Int Int)) (|v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_7229 (Array Int Int)) (|v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| Int) (v_ArrVal_7240 (Array Int Int))) (let ((.cse47 (+ |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| 4))) (let ((.cse51 (store |c_#pthreadsMutex| |c_~#cache~0.base| (store .cse0 .cse47 1)))) (let ((.cse50 (store (select (store .cse51 |c_~#__global_lock~0.base| v_ArrVal_7221) |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base|) (+ |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) (let ((.cse46 (select (store (store .cse51 |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| .cse50) |c_~#__global_lock~0.base| v_ArrVal_7224) |c_~#cache~0.base|))) (let ((.cse40 (store |c_#pthreadsMutex| |t_funThread2of8ForFork0_cache_entry_addref_~entry#1.base| .cse50)) (.cse44 (store .cse46 .cse1 1)) (.cse45 (+ |v_t_funThread2of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (let ((.cse49 (store .cse40 |c_~#cache~0.base| (store .cse44 .cse45 1)))) (let ((.cse41 (store (select (store .cse49 |c_~#__global_lock~0.base| v_ArrVal_7229) |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|) .cse12 0))) (let ((.cse48 (select (store (store .cse49 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse41) |c_~#__global_lock~0.base| v_ArrVal_7232) |c_~#cache~0.base|))) (let ((.cse42 (store .cse48 .cse3 1)) (.cse43 (+ |v_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset_38| 4))) (or (< |v_t_funThread1of8ForFork0_cache_entry_addref_~entry#1.offset_35| (+ (* |c_t_funThread1of8ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (select (select (store (let ((.cse39 (store (store .cse40 |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base| .cse41) |c_~#cache~0.base| (store .cse42 .cse43 1)))) (store .cse39 |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base| (store (select (store .cse39 |c_~#__global_lock~0.base| v_ArrVal_7237) |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|) .cse9 0))) |c_~#__global_lock~0.base| v_ArrVal_7240) |c_~#cache~0.base|) .cse3) 0)) (not (= (select .cse44 .cse45) 0)) (not (= (select .cse42 .cse43) 0)) (not (= (select .cse46 .cse1) 0)) (not (= (select .cse0 .cse47) 0)) (not (= (select .cse48 .cse3) 0))))))))))))) (not (= |c_~#cache~0.base| |c_~#__global_lock~0.base|)) (or (not (= |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) (not (= |c_~#cache~0.base| |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |c_t_funThread4of8ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) (not (= |c_~#cache~0.base| |c_t_funThread3of8ForFork0_cache_entry_addref_~entry#1.base|))))) is different from true [2024-05-08 03:02:37,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:40,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:42,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:51,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:02:53,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:05,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:06,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:09,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:11,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:14,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:30,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:32,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:35,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:37,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:03:59,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-05-08 03:04:00,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-08 03:04:15,605 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (34)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (61)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (46)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:15,606 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-08 03:04:16,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-05-08 03:04:16,016 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 177 known predicates. [2024-05-08 03:04:16,016 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2024-05-08 03:04:16,017 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 12 remaining) [2024-05-08 03:04:16,018 INFO L448 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-05-08 03:04:16,020 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 8 thread instances [2024-05-08 03:04:16,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-08 03:04:16,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.05 03:04:16 BasicIcfg [2024-05-08 03:04:16,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-08 03:04:16,024 INFO L158 Benchmark]: Toolchain (without parser) took 842271.15ms. Allocated memory was 327.2MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 258.2MB in the beginning and 1.2GB in the end (delta: -937.3MB). Peak memory consumption was 287.2MB. Max. memory is 8.0GB. [2024-05-08 03:04:16,024 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory was 135.3MB in the beginning and 135.3MB in the end (delta: 67.3kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-08 03:04:16,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.81ms. Allocated memory is still 327.2MB. Free memory was 258.1MB in the beginning and 276.8MB in the end (delta: -18.8MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2024-05-08 03:04:16,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.07ms. Allocated memory is still 327.2MB. Free memory was 276.8MB in the beginning and 273.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-08 03:04:16,025 INFO L158 Benchmark]: Boogie Preprocessor took 38.48ms. Allocated memory is still 327.2MB. Free memory was 273.8MB in the beginning and 271.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-08 03:04:16,025 INFO L158 Benchmark]: RCFGBuilder took 575.23ms. Allocated memory is still 327.2MB. Free memory was 271.7MB in the beginning and 243.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2024-05-08 03:04:16,025 INFO L158 Benchmark]: TraceAbstraction took 841050.69ms. Allocated memory was 327.2MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 241.8MB in the beginning and 1.2GB in the end (delta: -953.8MB). Peak memory consumption was 269.9MB. Max. memory is 8.0GB. [2024-05-08 03:04:16,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory was 135.3MB in the beginning and 135.3MB in the end (delta: 67.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 549.81ms. Allocated memory is still 327.2MB. Free memory was 258.1MB in the beginning and 276.8MB in the end (delta: -18.8MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.07ms. Allocated memory is still 327.2MB. Free memory was 276.8MB in the beginning and 273.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.48ms. Allocated memory is still 327.2MB. Free memory was 273.8MB in the beginning and 271.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 575.23ms. Allocated memory is still 327.2MB. Free memory was 271.7MB in the beginning and 243.3MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 841050.69ms. Allocated memory was 327.2MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 241.8MB in the beginning and 1.2GB in the end (delta: -953.8MB). Peak memory consumption was 269.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 673, independent: 543, independent conditional: 355, independent unconditional: 188, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 355, independent unconditional: 188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 355, independent unconditional: 188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 355, independent unconditional: 188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 155, independent unconditional: 388, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 543, independent: 543, independent conditional: 155, independent unconditional: 388, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 155, independent unconditional: 388, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 543, independent: 466, independent conditional: 155, independent unconditional: 311, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 155, independent unconditional: 388, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 543, independent: 543, independent conditional: 155, independent unconditional: 388, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 543, independent: 543, independent conditional: 155, independent unconditional: 388, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 543, independent: 466, independent conditional: 155, independent unconditional: 311, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 77, unknown conditional: 0, unknown unconditional: 77] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0 ], Independence queries for same thread: 130 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3841, independent: 3372, independent conditional: 2485, independent unconditional: 887, dependent: 469, dependent conditional: 469, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 2485, independent unconditional: 887, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 2485, independent unconditional: 887, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 2485, independent unconditional: 887, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 1184, independent unconditional: 2188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 1076, independent unconditional: 2296, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 1076, independent unconditional: 2296, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 403, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 403, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3372, independent: 2969, independent conditional: 1076, independent unconditional: 1893, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 403, unknown conditional: 0, unknown unconditional: 403] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 403, Positive conditional cache size: 0, Positive unconditional cache size: 403, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 108, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 1184, independent unconditional: 2188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 1076, independent unconditional: 2296, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3372, independent: 3372, independent conditional: 1076, independent unconditional: 2296, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 403, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 403, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3372, independent: 2969, independent conditional: 1076, independent unconditional: 1893, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 403, unknown conditional: 0, unknown unconditional: 403] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 403, Positive conditional cache size: 0, Positive unconditional cache size: 403, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 108 ], Independence queries for same thread: 469 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12300, independent: 11105, independent conditional: 8585, independent unconditional: 2520, dependent: 1195, dependent conditional: 1195, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 8585, independent unconditional: 2520, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 8585, independent unconditional: 2520, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 8585, independent unconditional: 2520, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 4170, independent unconditional: 6935, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 3525, independent unconditional: 7580, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 3525, independent unconditional: 7580, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 885, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 885, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11105, independent: 10220, independent conditional: 3525, independent unconditional: 6695, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 885, unknown conditional: 0, unknown unconditional: 885] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 0, Positive unconditional cache size: 885, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 645, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 4170, independent unconditional: 6935, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 3525, independent unconditional: 7580, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11105, independent: 11105, independent conditional: 3525, independent unconditional: 7580, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 885, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 885, independent: 881, independent conditional: 0, independent unconditional: 881, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11105, independent: 10220, independent conditional: 3525, independent unconditional: 6695, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 885, unknown conditional: 0, unknown unconditional: 885] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 0, Positive unconditional cache size: 885, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 645 ], Independence queries for same thread: 1195 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30217, independent: 27892, independent conditional: 21523, independent unconditional: 6369, dependent: 2325, dependent conditional: 2325, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27892, independent: 27892, independent conditional: 21523, independent unconditional: 6369, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27892, independent: 27892, independent conditional: 21523, independent unconditional: 6369, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27892, independent: 27892, independent conditional: 21523, independent unconditional: 6369, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27898, independent: 27892, independent conditional: 10161, independent unconditional: 17731, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27898, independent: 27892, independent conditional: 8966, independent unconditional: 18926, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27898, independent: 27892, independent conditional: 8966, independent unconditional: 18926, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1829, independent: 1825, independent conditional: 2, independent unconditional: 1823, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1829, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 52, independent conditional: 8, independent unconditional: 44, dependent: 21, dependent conditional: 16, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27898, independent: 26067, independent conditional: 8964, independent unconditional: 17103, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1829, unknown conditional: 4, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 1829, Positive cache size: 1825, Positive conditional cache size: 2, Positive unconditional cache size: 1823, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1195, Maximal queried relation: 2, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27898, independent: 27892, independent conditional: 10161, independent unconditional: 17731, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27898, independent: 27892, independent conditional: 8966, independent unconditional: 18926, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27898, independent: 27892, independent conditional: 8966, independent unconditional: 18926, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1829, independent: 1825, independent conditional: 2, independent unconditional: 1823, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1829, independent: 1811, independent conditional: 0, independent unconditional: 1811, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 52, independent conditional: 8, independent unconditional: 44, dependent: 21, dependent conditional: 16, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27898, independent: 26067, independent conditional: 8964, independent unconditional: 17103, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 1829, unknown conditional: 4, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 1829, Positive cache size: 1825, Positive conditional cache size: 2, Positive unconditional cache size: 1823, Negative cache size: 4, Negative conditional cache size: 2, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1195 ], Independence queries for same thread: 2325 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 83441, independent: 78418, independent conditional: 64011, independent unconditional: 14407, dependent: 5023, dependent conditional: 5017, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 78450, independent: 78418, independent conditional: 64011, independent unconditional: 14407, dependent: 32, dependent conditional: 26, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78450, independent: 78418, independent conditional: 64011, independent unconditional: 14407, dependent: 32, dependent conditional: 26, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78450, independent: 78418, independent conditional: 64011, independent unconditional: 14407, dependent: 32, dependent conditional: 26, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78571, independent: 78418, independent conditional: 30317, independent unconditional: 48101, dependent: 153, dependent conditional: 71, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78571, independent: 78418, independent conditional: 25014, independent unconditional: 53404, dependent: 153, dependent conditional: 60, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78571, independent: 78418, independent conditional: 25014, independent unconditional: 53404, dependent: 153, dependent conditional: 60, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3270, independent: 3228, independent conditional: 59, independent unconditional: 3169, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3270, independent: 3179, independent conditional: 0, independent unconditional: 3179, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 91, independent: 49, independent conditional: 25, independent unconditional: 24, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 49, independent conditional: 25, independent unconditional: 24, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 106, independent conditional: 44, independent unconditional: 62, dependent: 77, dependent conditional: 58, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 78571, independent: 75190, independent conditional: 24955, independent unconditional: 50235, dependent: 111, dependent conditional: 31, dependent unconditional: 80, unknown: 3270, unknown conditional: 88, unknown unconditional: 3182] , Statistics on independence cache: Total cache size (in pairs): 3270, Positive cache size: 3228, Positive conditional cache size: 59, Positive unconditional cache size: 3169, Negative cache size: 42, Negative conditional cache size: 29, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5314, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78571, independent: 78418, independent conditional: 30317, independent unconditional: 48101, dependent: 153, dependent conditional: 71, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78571, independent: 78418, independent conditional: 25014, independent unconditional: 53404, dependent: 153, dependent conditional: 60, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78571, independent: 78418, independent conditional: 25014, independent unconditional: 53404, dependent: 153, dependent conditional: 60, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3270, independent: 3228, independent conditional: 59, independent unconditional: 3169, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3270, independent: 3179, independent conditional: 0, independent unconditional: 3179, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 91, independent: 49, independent conditional: 25, independent unconditional: 24, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 49, independent conditional: 25, independent unconditional: 24, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 183, independent: 106, independent conditional: 44, independent unconditional: 62, dependent: 77, dependent conditional: 58, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 78571, independent: 75190, independent conditional: 24955, independent unconditional: 50235, dependent: 111, dependent conditional: 31, dependent unconditional: 80, unknown: 3270, unknown conditional: 88, unknown unconditional: 3182] , Statistics on independence cache: Total cache size (in pairs): 3270, Positive cache size: 3228, Positive conditional cache size: 59, Positive unconditional cache size: 3169, Negative cache size: 42, Negative conditional cache size: 29, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5314 ], Independence queries for same thread: 4991 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 179293, independent: 169887, independent conditional: 142502, independent unconditional: 27385, dependent: 9406, dependent conditional: 9394, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 169948, independent: 169887, independent conditional: 142502, independent unconditional: 27385, dependent: 61, dependent conditional: 49, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169948, independent: 169887, independent conditional: 142502, independent unconditional: 27385, dependent: 61, dependent conditional: 49, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169948, independent: 169887, independent conditional: 142502, independent unconditional: 27385, dependent: 61, dependent conditional: 49, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170221, independent: 169887, independent conditional: 68297, independent unconditional: 101590, dependent: 334, dependent conditional: 182, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170221, independent: 169887, independent conditional: 52988, independent unconditional: 116899, dependent: 334, dependent conditional: 143, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170221, independent: 169887, independent conditional: 52988, independent unconditional: 116899, dependent: 334, dependent conditional: 143, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5257, independent: 5196, independent conditional: 85, independent unconditional: 5111, dependent: 61, dependent conditional: 45, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5257, independent: 5132, independent conditional: 0, independent unconditional: 5132, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 125, independent: 64, independent conditional: 26, independent unconditional: 38, dependent: 61, dependent conditional: 45, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 125, independent: 64, independent conditional: 26, independent unconditional: 38, dependent: 61, dependent conditional: 45, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 112, independent conditional: 45, independent unconditional: 68, dependent: 117, dependent conditional: 95, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 170221, independent: 164691, independent conditional: 52903, independent unconditional: 111788, dependent: 273, dependent conditional: 98, dependent unconditional: 175, unknown: 5257, unknown conditional: 130, unknown unconditional: 5127] , Statistics on independence cache: Total cache size (in pairs): 5257, Positive cache size: 5196, Positive conditional cache size: 85, Positive unconditional cache size: 5111, Negative cache size: 61, Negative conditional cache size: 45, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15348, Maximal queried relation: 9, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170221, independent: 169887, independent conditional: 68297, independent unconditional: 101590, dependent: 334, dependent conditional: 182, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170221, independent: 169887, independent conditional: 52988, independent unconditional: 116899, dependent: 334, dependent conditional: 143, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170221, independent: 169887, independent conditional: 52988, independent unconditional: 116899, dependent: 334, dependent conditional: 143, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5257, independent: 5196, independent conditional: 85, independent unconditional: 5111, dependent: 61, dependent conditional: 45, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5257, independent: 5132, independent conditional: 0, independent unconditional: 5132, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 125, independent: 64, independent conditional: 26, independent unconditional: 38, dependent: 61, dependent conditional: 45, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 125, independent: 64, independent conditional: 26, independent unconditional: 38, dependent: 61, dependent conditional: 45, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 112, independent conditional: 45, independent unconditional: 68, dependent: 117, dependent conditional: 95, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 170221, independent: 164691, independent conditional: 52903, independent unconditional: 111788, dependent: 273, dependent conditional: 98, dependent unconditional: 175, unknown: 5257, unknown conditional: 130, unknown unconditional: 5127] , Statistics on independence cache: Total cache size (in pairs): 5257, Positive cache size: 5196, Positive conditional cache size: 85, Positive unconditional cache size: 5111, Negative cache size: 61, Negative conditional cache size: 45, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15348 ], Independence queries for same thread: 9345 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 312323, independent: 297218, independent conditional: 251630, independent unconditional: 45588, dependent: 15105, dependent conditional: 15087, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 297308, independent: 297218, independent conditional: 251630, independent unconditional: 45588, dependent: 90, dependent conditional: 72, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297308, independent: 297218, independent conditional: 251630, independent unconditional: 45588, dependent: 90, dependent conditional: 72, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 297308, independent: 297218, independent conditional: 251630, independent unconditional: 45588, dependent: 90, dependent conditional: 72, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297797, independent: 297218, independent conditional: 119815, independent unconditional: 177403, dependent: 579, dependent conditional: 362, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297797, independent: 297218, independent conditional: 93880, independent unconditional: 203338, dependent: 579, dependent conditional: 256, dependent unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297797, independent: 297218, independent conditional: 93880, independent unconditional: 203338, dependent: 579, dependent conditional: 256, dependent unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7324, independent: 7233, independent conditional: 199, independent unconditional: 7034, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7324, independent: 7116, independent conditional: 0, independent unconditional: 7116, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 208, independent: 117, independent conditional: 47, independent unconditional: 70, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 208, independent: 117, independent conditional: 47, independent unconditional: 70, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, independent: 179, independent conditional: 72, independent unconditional: 108, dependent: 158, dependent conditional: 132, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 297797, independent: 289985, independent conditional: 93681, independent unconditional: 196304, dependent: 488, dependent conditional: 185, dependent unconditional: 303, unknown: 7324, unknown conditional: 270, unknown unconditional: 7054] , Statistics on independence cache: Total cache size (in pairs): 7324, Positive cache size: 7233, Positive conditional cache size: 199, Positive unconditional cache size: 7034, Negative cache size: 91, Negative conditional cache size: 71, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26041, Maximal queried relation: 12, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 297797, independent: 297218, independent conditional: 119815, independent unconditional: 177403, dependent: 579, dependent conditional: 362, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 297797, independent: 297218, independent conditional: 93880, independent unconditional: 203338, dependent: 579, dependent conditional: 256, dependent unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 297797, independent: 297218, independent conditional: 93880, independent unconditional: 203338, dependent: 579, dependent conditional: 256, dependent unconditional: 323, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7324, independent: 7233, independent conditional: 199, independent unconditional: 7034, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7324, independent: 7116, independent conditional: 0, independent unconditional: 7116, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 208, independent: 117, independent conditional: 47, independent unconditional: 70, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 208, independent: 117, independent conditional: 47, independent unconditional: 70, dependent: 91, dependent conditional: 71, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, independent: 179, independent conditional: 72, independent unconditional: 108, dependent: 158, dependent conditional: 132, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 297797, independent: 289985, independent conditional: 93681, independent unconditional: 196304, dependent: 488, dependent conditional: 185, dependent unconditional: 303, unknown: 7324, unknown conditional: 270, unknown unconditional: 7054] , Statistics on independence cache: Total cache size (in pairs): 7324, Positive cache size: 7233, Positive conditional cache size: 199, Positive unconditional cache size: 7034, Negative cache size: 91, Negative conditional cache size: 71, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26041 ], Independence queries for same thread: 15015 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 360532, independent: 344876, independent conditional: 273881, independent unconditional: 70995, dependent: 15656, dependent conditional: 15623, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 344992, independent: 344876, independent conditional: 273881, independent unconditional: 70995, dependent: 116, dependent conditional: 83, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344992, independent: 344876, independent conditional: 273881, independent unconditional: 70995, dependent: 116, dependent conditional: 83, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344992, independent: 344876, independent conditional: 273881, independent unconditional: 70995, dependent: 116, dependent conditional: 83, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 345244, independent: 344876, independent conditional: 129696, independent unconditional: 215180, dependent: 368, dependent conditional: 148, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 345244, independent: 344876, independent conditional: 113389, independent unconditional: 231487, dependent: 368, dependent conditional: 113, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 345244, independent: 344876, independent conditional: 113389, independent unconditional: 231487, dependent: 368, dependent conditional: 113, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9082, independent: 8975, independent conditional: 197, independent unconditional: 8778, dependent: 107, dependent conditional: 76, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9082, independent: 8873, independent conditional: 0, independent unconditional: 8873, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 209, independent: 102, independent conditional: 38, independent unconditional: 64, dependent: 107, dependent conditional: 76, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 209, independent: 102, independent conditional: 38, independent unconditional: 64, dependent: 107, dependent conditional: 76, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 312, independent: 127, independent conditional: 51, independent unconditional: 77, dependent: 185, dependent conditional: 150, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 345244, independent: 335901, independent conditional: 113192, independent unconditional: 222709, dependent: 261, dependent conditional: 37, dependent unconditional: 224, unknown: 9082, unknown conditional: 273, unknown unconditional: 8809] , Statistics on independence cache: Total cache size (in pairs): 9082, Positive cache size: 8975, Positive conditional cache size: 197, Positive unconditional cache size: 8778, Negative cache size: 107, Negative conditional cache size: 76, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16342, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 345244, independent: 344876, independent conditional: 129696, independent unconditional: 215180, dependent: 368, dependent conditional: 148, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 345244, independent: 344876, independent conditional: 113389, independent unconditional: 231487, dependent: 368, dependent conditional: 113, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 345244, independent: 344876, independent conditional: 113389, independent unconditional: 231487, dependent: 368, dependent conditional: 113, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9082, independent: 8975, independent conditional: 197, independent unconditional: 8778, dependent: 107, dependent conditional: 76, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9082, independent: 8873, independent conditional: 0, independent unconditional: 8873, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 209, independent: 102, independent conditional: 38, independent unconditional: 64, dependent: 107, dependent conditional: 76, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 209, independent: 102, independent conditional: 38, independent unconditional: 64, dependent: 107, dependent conditional: 76, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 312, independent: 127, independent conditional: 51, independent unconditional: 77, dependent: 185, dependent conditional: 150, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 345244, independent: 335901, independent conditional: 113192, independent unconditional: 222709, dependent: 261, dependent conditional: 37, dependent unconditional: 224, unknown: 9082, unknown conditional: 273, unknown unconditional: 8809] , Statistics on independence cache: Total cache size (in pairs): 9082, Positive cache size: 8975, Positive conditional cache size: 197, Positive unconditional cache size: 8778, Negative cache size: 107, Negative conditional cache size: 76, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16342 ], Independence queries for same thread: 15540 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 177 known predicates. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 177 known predicates. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 177 known predicates. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 177 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 288 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 985 SizeOfPredicates, 22 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 50/443 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 351 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 948 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2660 SizeOfPredicates, 35 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 474/1097 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 414 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1711 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2354 ConstructedInterpolants, 0 QuantifiedInterpolants, 7058 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1646 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 2435/3108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 477 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2150 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2986 ConstructedInterpolants, 83 QuantifiedInterpolants, 13195 SizeOfPredicates, 59 NumberOfNonLiveVariables, 2064 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 3054/3787 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.1s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 540 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 5.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 3936 NumberOfCodeBlocks, 3874 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5363 ConstructedInterpolants, 83 QuantifiedInterpolants, 28792 SizeOfPredicates, 82 NumberOfNonLiveVariables, 3728 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 6195/7188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 6 thread instances CFG has 8 procedures, 603 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 33.0s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 10.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 285, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 6316 NumberOfCodeBlocks, 6259 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8840 ConstructedInterpolants, 83 QuantifiedInterpolants, 43779 SizeOfPredicates, 120 NumberOfNonLiveVariables, 6380 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 11269/12599 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.2s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 0, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 7 thread instances CFG has 9 procedures, 666 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 107.2s, OverallIterations: 17, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 17.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 381, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 74.1s InterpolantComputationTime, 9003 NumberOfCodeBlocks, 8951 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 12752 ConstructedInterpolants, 294 QuantifiedInterpolants, 72231 SizeOfPredicates, 195 NumberOfNonLiveVariables, 9238 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 17409/19576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 0.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 2, ConditionalCommutativityTraceChecks: 0, ConditionalCommutativityImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data with 8 thread instances CFG has 10 procedures, 729 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 656.6s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 411.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 237.9s InterpolantComputationTime, 4320 NumberOfCodeBlocks, 4273 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5870 ConstructedInterpolants, 375 QuantifiedInterpolants, 89702 SizeOfPredicates, 74 NumberOfNonLiveVariables, 3574 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5721/6711 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 4.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityConditionCalculations: 1, ConditionalCommutativityTraceChecks: 1, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown