/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD --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_28-funptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-07 01:23:04,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-07 01:23:04,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-07 01:23:04,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-07 01:23:04,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-07 01:23:04,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-07 01:23:04,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-07 01:23:04,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-07 01:23:04,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-07 01:23:04,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-07 01:23:04,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-07 01:23:04,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-07 01:23:04,742 INFO L153 SettingsManager]: * Use SBE=true [2024-05-07 01:23:04,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-07 01:23:04,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-07 01:23:04,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-07 01:23:04,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-07 01:23:04,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-07 01:23:04,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-07 01:23:04,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-07 01:23:04,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-07 01:23:04,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-07 01:23:04,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-07 01:23:04,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-07 01:23:04,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-07 01:23:04,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-07 01:23:04,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-07 01:23:04,747 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-07 01:23:04,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-07 01:23:04,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 01:23:04,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-07 01:23:04,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-07 01:23:04,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-07 01:23:04,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-07 01:23:04,749 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-07 01:23:04,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-07 01:23:04,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-07 01:23:04,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-07 01:23:04,750 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-07 01:23:04,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD 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-07 01:23:05,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-07 01:23:05,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-07 01:23:05,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-07 01:23:05,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-07 01:23:05,064 INFO L274 PluginConnector]: CDTParser initialized [2024-05-07 01:23:05,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-05-07 01:23:06,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-07 01:23:06,635 INFO L384 CDTParser]: Found 1 translation units. [2024-05-07 01:23:06,636 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2024-05-07 01:23:06,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/41451b426/8c19465f34f5434383d8b0cf48d615e3/FLAGdd9f00280 [2024-05-07 01:23:06,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/41451b426/8c19465f34f5434383d8b0cf48d615e3 [2024-05-07 01:23:06,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-07 01:23:06,670 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-07 01:23:06,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-07 01:23:06,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-07 01:23:06,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-07 01:23:06,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 01:23:06" (1/1) ... [2024-05-07 01:23:06,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:06, skipping insertion in model container [2024-05-07 01:23:06,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.05 01:23:06" (1/1) ... [2024-05-07 01:23:06,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-07 01:23:07,176 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_28-funptr_racefree.i[41323,41336] [2024-05-07 01:23:07,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 01:23:07,222 INFO L202 MainTranslator]: Completed pre-run [2024-05-07 01:23:07,265 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_28-funptr_racefree.i[41323,41336] [2024-05-07 01:23:07,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-07 01:23:07,340 WARN L675 CHandler]: The function g is called, but not defined or handled by StandardFunctionHandler. [2024-05-07 01:23:07,347 INFO L206 MainTranslator]: Completed translation [2024-05-07 01:23:07,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07 WrapperNode [2024-05-07 01:23:07,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-07 01:23:07,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-07 01:23:07,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-07 01:23:07,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-07 01:23:07,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,428 INFO L138 Inliner]: procedures = 274, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-05-07 01:23:07,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-07 01:23:07,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-07 01:23:07,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-07 01:23:07,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-07 01:23:07,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-07 01:23:07,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-07 01:23:07,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-07 01:23:07,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-07 01:23:07,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (1/1) ... [2024-05-07 01:23:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-07 01:23:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:07,499 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-07 01:23:07,510 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-07 01:23:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-07 01:23:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-05-07 01:23:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-07 01:23:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-07 01:23:07,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-07 01:23:07,549 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-07 01:23:07,666 INFO L241 CfgBuilder]: Building ICFG [2024-05-07 01:23:07,668 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-07 01:23:07,934 INFO L282 CfgBuilder]: Performing block encoding [2024-05-07 01:23:07,965 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-07 01:23:07,965 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2024-05-07 01:23:07,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 01:23:07 BoogieIcfgContainer [2024-05-07 01:23:07,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-07 01:23:07,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-07 01:23:07,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-07 01:23:07,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-07 01:23:07,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.05 01:23:06" (1/3) ... [2024-05-07 01:23:07,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de904c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 01:23:07, skipping insertion in model container [2024-05-07 01:23:07,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.05 01:23:07" (2/3) ... [2024-05-07 01:23:07,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de904c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 01:23:07, skipping insertion in model container [2024-05-07 01:23:07,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 01:23:07" (3/3) ... [2024-05-07 01:23:07,981 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2024-05-07 01:23:07,988 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-07 01:23:07,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-07 01:23:07,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-07 01:23:07,998 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-07 01:23:08,063 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-07 01:23:08,107 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:08,111 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-07 01:23:08,111 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-07 01:23:08,141 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:08,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:08,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:08,160 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:08,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:08,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:08,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 374295123, now seen corresponding path program 1 times [2024-05-07 01:23:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255218708] [2024-05-07 01:23:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:08,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255218708] [2024-05-07 01:23:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255218708] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830536460] [2024-05-07 01:23:08,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:08,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:08,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:08,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-07 01:23:08,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:08,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-07 01:23:08,588 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:08,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1877096707, now seen corresponding path program 1 times [2024-05-07 01:23:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:08,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26062194] [2024-05-07 01:23:08,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:08,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:08,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:08,705 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:08,707 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:08,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:08,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-07 01:23:08,713 INFO L448 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-07 01:23:08,715 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:08,715 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-05-07 01:23:08,755 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-07 01:23:08,761 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:08,810 INFO L229 MonitoredProcess]: Starting monitored process 3 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-07 01:23:08,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-07 01:23:08,814 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:08,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:08,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:08,817 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:08,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:08,856 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:08,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1699779948, now seen corresponding path program 1 times [2024-05-07 01:23:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180529081] [2024-05-07 01:23:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-07 01:23:08,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:08,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180529081] [2024-05-07 01:23:08,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180529081] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:08,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:08,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454840112] [2024-05-07 01:23:08,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:08,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:08,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:08,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:08,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:08,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:08,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 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-07 01:23:08,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:09,201 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 1030 treesize of output 934 [2024-05-07 01:23:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1337045156, now seen corresponding path program 1 times [2024-05-07 01:23:09,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:09,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:09,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:09,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2024-05-07 01:23:09,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:09,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1280751276, now seen corresponding path program 1 times [2024-05-07 01:23:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:09,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79539382] [2024-05-07 01:23:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:09,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79539382] [2024-05-07 01:23:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79539382] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:09,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:09,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-07 01:23:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674916121] [2024-05-07 01:23:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:09,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-07 01:23:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-07 01:23:09,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:09,919 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:09,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 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-07 01:23:09,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:09,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:10,169 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:10,169 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 296 treesize of output 268 [2024-05-07 01:23:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1337045156, now seen corresponding path program 2 times [2024-05-07 01:23:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:10,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 01:23:10,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5 [2024-05-07 01:23:10,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:10,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash 575583817, now seen corresponding path program 1 times [2024-05-07 01:23:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:10,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056796792] [2024-05-07 01:23:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056796792] [2024-05-07 01:23:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056796792] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-07 01:23:10,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158685643] [2024-05-07 01:23:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:10,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 01:23:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:10,752 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-07 01:23:10,779 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-07 01:23:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:10,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-07 01:23:10,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-07 01:23:11,151 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-07 01:23:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 01:23:11,320 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-07 01:23:11,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 01:23:11,354 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-07 01:23:11,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 01:23:11,433 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-07 01:23:11,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 01:23:11,469 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-07 01:23:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:11,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-07 01:23:13,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-07 01:23:13,699 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 22 treesize of output 23 [2024-05-07 01:23:13,706 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 131 treesize of output 119 [2024-05-07 01:23:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158685643] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-07 01:23:13,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-07 01:23:13,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-05-07 01:23:13,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681633744] [2024-05-07 01:23:13,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-07 01:23:13,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-07 01:23:13,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-07 01:23:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=249, Unknown=3, NotChecked=0, Total=342 [2024-05-07 01:23:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:13,856 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:13,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.473684210526315) internal successors, (218), 19 states have internal predecessors, (218), 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-07 01:23:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-07 01:23:13,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-07 01:23:14,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 01:23:14,053 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-07 01:23:14,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-07 01:23:14,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:14,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1427066090, now seen corresponding path program 1 times [2024-05-07 01:23:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129122463] [2024-05-07 01:23:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:14,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:14,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:14,315 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:14,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:14,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:14,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-07 01:23:14,319 INFO L448 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-05-07 01:23:14,319 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:14,319 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-05-07 01:23:14,345 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-07 01:23:14,375 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:14,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:14,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:14,381 INFO L229 MonitoredProcess]: Starting monitored process 5 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-07 01:23:14,389 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:14,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:14,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:14,390 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:14,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:14,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-07 01:23:14,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:14,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:14,416 INFO L85 PathProgramCache]: Analyzing trace with hash 192347814, now seen corresponding path program 1 times [2024-05-07 01:23:14,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:14,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951354908] [2024-05-07 01:23:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-05-07 01:23:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951354908] [2024-05-07 01:23:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951354908] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:14,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:14,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169888686] [2024-05-07 01:23:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:14,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:14,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:14,462 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:14,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 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-07 01:23:14,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:14,571 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 262 treesize of output 238 [2024-05-07 01:23:14,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 1 times [2024-05-07 01:23:14,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:14,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:14,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:14,786 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:14,786 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 568 treesize of output 520 [2024-05-07 01:23:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 589722510, now seen corresponding path program 1 times [2024-05-07 01:23:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:15,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:15,328 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:15,328 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 550 treesize of output 498 [2024-05-07 01:23:15,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 2 times [2024-05-07 01:23:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:15,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:15,618 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:15,619 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 270 treesize of output 242 [2024-05-07 01:23:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 673103727, now seen corresponding path program 1 times [2024-05-07 01:23:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:16,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:16,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:16,479 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:16,480 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 576 treesize of output 524 [2024-05-07 01:23:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 3 times [2024-05-07 01:23:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:16,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:16,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-05-07 01:23:16,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:16,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1454984234, now seen corresponding path program 1 times [2024-05-07 01:23:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742617816] [2024-05-07 01:23:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-07 01:23:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742617816] [2024-05-07 01:23:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742617816] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:17,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 01:23:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914737555] [2024-05-07 01:23:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:17,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 01:23:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 01:23:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:17,049 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:17,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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-07 01:23:17,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:17,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:17,276 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:17,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 01:23:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1902020386, now seen corresponding path program 4 times [2024-05-07 01:23:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-05-07 01:23:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 01:23:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-07 01:23:17,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:17,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash 420067488, now seen corresponding path program 1 times [2024-05-07 01:23:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:17,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44617644] [2024-05-07 01:23:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:17,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:17,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:17,828 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:17,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:17,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:17,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-07 01:23:17,830 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:17,830 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:17,830 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-05-07 01:23:17,857 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-07 01:23:17,860 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:17,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:17,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:17,868 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-07 01:23:17,871 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:17,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:17,871 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:17,872 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:17,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:17,872 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-07 01:23:17,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:17,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1378155713, now seen corresponding path program 1 times [2024-05-07 01:23:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:17,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802084147] [2024-05-07 01:23:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-05-07 01:23:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802084147] [2024-05-07 01:23:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802084147] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874821030] [2024-05-07 01:23:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:17,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:17,923 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:17,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 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-07 01:23:17,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:18,035 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:18,036 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 1038 treesize of output 942 [2024-05-07 01:23:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 1 times [2024-05-07 01:23:18,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:18,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:18,224 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 542 treesize of output 494 [2024-05-07 01:23:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash 194466180, now seen corresponding path program 1 times [2024-05-07 01:23:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:18,741 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:18,741 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 1046 treesize of output 946 [2024-05-07 01:23:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 2 times [2024-05-07 01:23:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:18,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:18,985 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:18,986 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 540 treesize of output 488 [2024-05-07 01:23:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 144113478, now seen corresponding path program 1 times [2024-05-07 01:23:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:19,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:19,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:19,720 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:19,721 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 1046 treesize of output 946 [2024-05-07 01:23:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 3 times [2024-05-07 01:23:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:19,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:20,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2024-05-07 01:23:20,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:20,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash -126720901, now seen corresponding path program 1 times [2024-05-07 01:23:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067993296] [2024-05-07 01:23:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-05-07 01:23:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067993296] [2024-05-07 01:23:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067993296] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:20,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-07 01:23:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978739738] [2024-05-07 01:23:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:20,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-07 01:23:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:20,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:20,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-07 01:23:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:20,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:20,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 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-07 01:23:20,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:20,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:20,633 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:20,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:23:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 302819563, now seen corresponding path program 4 times [2024-05-07 01:23:20,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:20,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:20,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-05-07 01:23:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-07 01:23:21,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable28 [2024-05-07 01:23:21,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:21,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1833313532, now seen corresponding path program 1 times [2024-05-07 01:23:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398509928] [2024-05-07 01:23:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:21,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:21,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:21,198 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:21,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:21,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-07 01:23:21,202 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:21,202 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:21,202 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-05-07 01:23:21,244 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-05-07 01:23:21,247 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:21,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:21,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:21,252 INFO L229 MonitoredProcess]: Starting monitored process 7 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-07 01:23:21,261 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:21,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:21,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:21,262 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:21,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:21,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-07 01:23:21,283 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:21,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1186794371, now seen corresponding path program 1 times [2024-05-07 01:23:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196150554] [2024-05-07 01:23:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-05-07 01:23:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196150554] [2024-05-07 01:23:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196150554] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:21,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:21,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898763731] [2024-05-07 01:23:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:21,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:21,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:21,322 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:21,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 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-07 01:23:21,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:21,418 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 542 treesize of output 494 [2024-05-07 01:23:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 1 times [2024-05-07 01:23:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:21,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:21,569 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:21,570 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 1038 treesize of output 942 [2024-05-07 01:23:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash -130422284, now seen corresponding path program 1 times [2024-05-07 01:23:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:21,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:22,100 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:22,101 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 514 treesize of output 462 [2024-05-07 01:23:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 2 times [2024-05-07 01:23:22,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:22,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:22,318 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:22,319 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 522 treesize of output 470 [2024-05-07 01:23:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1671811121, now seen corresponding path program 1 times [2024-05-07 01:23:22,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:22,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:22,978 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:22,979 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 540 treesize of output 488 [2024-05-07 01:23:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 3 times [2024-05-07 01:23:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:23,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:23,816 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 259 treesize of output 235 [2024-05-07 01:23:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 76098321, now seen corresponding path program 1 times [2024-05-07 01:23:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:24,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:24,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:24,650 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:24,651 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 514 treesize of output 462 [2024-05-07 01:23:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2005365846, now seen corresponding path program 4 times [2024-05-07 01:23:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:24,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:25,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-07 01:23:25,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:25,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1900711786, now seen corresponding path program 1 times [2024-05-07 01:23:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:25,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959001893] [2024-05-07 01:23:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:25,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:25,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:25,395 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:25,396 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:25,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:25,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-07 01:23:25,397 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:25,397 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:25,397 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-05-07 01:23:25,436 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-05-07 01:23:25,439 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:25,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:25,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:25,444 INFO L229 MonitoredProcess]: Starting monitored process 8 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-07 01:23:25,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-05-07 01:23:25,447 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:25,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:25,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:25,448 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:25,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:25,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:25,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash -431343718, now seen corresponding path program 1 times [2024-05-07 01:23:25,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:25,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949435703] [2024-05-07 01:23:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-05-07 01:23:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949435703] [2024-05-07 01:23:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949435703] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:25,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:25,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045409337] [2024-05-07 01:23:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:25,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:25,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:25,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:25,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 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-07 01:23:25,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:25,606 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 542 treesize of output 494 [2024-05-07 01:23:25,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 1 times [2024-05-07 01:23:25,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:25,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:25,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:25,827 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:25,828 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 270 treesize of output 246 [2024-05-07 01:23:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash -692925988, now seen corresponding path program 1 times [2024-05-07 01:23:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:26,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:26,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:26,253 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:26,254 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 550 treesize of output 498 [2024-05-07 01:23:26,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 2 times [2024-05-07 01:23:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:26,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:26,507 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:26,508 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 1064 treesize of output 964 [2024-05-07 01:23:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1662653961, now seen corresponding path program 1 times [2024-05-07 01:23:26,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:26,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:27,179 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:27,184 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 296 treesize of output 268 [2024-05-07 01:23:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 3 times [2024-05-07 01:23:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:27,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:28,300 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 259 treesize of output 235 [2024-05-07 01:23:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1755112426, now seen corresponding path program 1 times [2024-05-07 01:23:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:28,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:28,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:29,193 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:29,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 268 [2024-05-07 01:23:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2104507002, now seen corresponding path program 4 times [2024-05-07 01:23:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:29,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:29,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:30,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable45,SelfDestructingSolverStorable56,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-05-07 01:23:30,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:30,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1492413374, now seen corresponding path program 1 times [2024-05-07 01:23:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971257730] [2024-05-07 01:23:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:30,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:30,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:30,150 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:30,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:30,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:30,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-05-07 01:23:30,151 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:30,151 WARN L233 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:30,151 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-05-07 01:23:30,186 INFO L144 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-05-07 01:23:30,190 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:30,196 INFO L229 MonitoredProcess]: Starting monitored process 9 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-07 01:23:30,206 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:30,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:30,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:30,207 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:30,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:30,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2024-05-07 01:23:30,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:30,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash -244800296, now seen corresponding path program 1 times [2024-05-07 01:23:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480075315] [2024-05-07 01:23:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-05-07 01:23:30,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:30,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480075315] [2024-05-07 01:23:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480075315] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160288608] [2024-05-07 01:23:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:30,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:30,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:30,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:30,280 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:30,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 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-07 01:23:30,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:30,376 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:30,377 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 270 treesize of output 246 [2024-05-07 01:23:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 1 times [2024-05-07 01:23:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:30,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:30,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:30,546 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 542 treesize of output 494 [2024-05-07 01:23:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -630777171, now seen corresponding path program 1 times [2024-05-07 01:23:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:30,923 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:30,923 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 1046 treesize of output 946 [2024-05-07 01:23:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 2 times [2024-05-07 01:23:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:31,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:31,136 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:31,137 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 1064 treesize of output 964 [2024-05-07 01:23:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash -829798111, now seen corresponding path program 1 times [2024-05-07 01:23:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:31,746 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:31,746 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 558 treesize of output 506 [2024-05-07 01:23:31,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 3 times [2024-05-07 01:23:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:31,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:31,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:32,642 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 1018 treesize of output 922 [2024-05-07 01:23:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1947292791, now seen corresponding path program 1 times [2024-05-07 01:23:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:33,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:33,489 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:33,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:23:33,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1789711449, now seen corresponding path program 4 times [2024-05-07 01:23:33,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:33,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:33,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:34,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:34,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable58,SelfDestructingSolverStorable69,SelfDestructingSolverStorable59 [2024-05-07 01:23:34,350 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:34,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1948108625, now seen corresponding path program 1 times [2024-05-07 01:23:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851803840] [2024-05-07 01:23:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:34,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:34,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:34,433 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:34,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:34,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:34,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-05-07 01:23:34,435 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:34,435 WARN L233 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:34,435 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-05-07 01:23:34,470 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-05-07 01:23:34,473 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:34,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:34,480 INFO L229 MonitoredProcess]: Starting monitored process 10 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-07 01:23:34,489 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:34,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:34,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:34,489 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:34,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:34,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-05-07 01:23:34,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:34,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1359184393, now seen corresponding path program 1 times [2024-05-07 01:23:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:34,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437234856] [2024-05-07 01:23:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:34,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-05-07 01:23:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437234856] [2024-05-07 01:23:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437234856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:34,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039282254] [2024-05-07 01:23:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:34,559 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:34,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 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-07 01:23:34,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:34,658 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:34,658 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 514 treesize of output 466 [2024-05-07 01:23:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 1 times [2024-05-07 01:23:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:34,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:34,860 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:34,861 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 514 treesize of output 466 [2024-05-07 01:23:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash -514436760, now seen corresponding path program 1 times [2024-05-07 01:23:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:35,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:35,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:35,237 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:35,237 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 1046 treesize of output 946 [2024-05-07 01:23:35,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 2 times [2024-05-07 01:23:35,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:35,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:35,424 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:35,425 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 576 treesize of output 524 [2024-05-07 01:23:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash -801195652, now seen corresponding path program 1 times [2024-05-07 01:23:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:35,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:35,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:35,974 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:35,975 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 1046 treesize of output 946 [2024-05-07 01:23:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 3 times [2024-05-07 01:23:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:36,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:36,886 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 500 treesize of output 452 [2024-05-07 01:23:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash 994305511, now seen corresponding path program 1 times [2024-05-07 01:23:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:37,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:37,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:37,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:37,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:37,571 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:37,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:23:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1024903839, now seen corresponding path program 4 times [2024-05-07 01:23:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:37,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:38,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable71,SelfDestructingSolverStorable82,SelfDestructingSolverStorable72,SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,SelfDestructingSolverStorable75,SelfDestructingSolverStorable76,SelfDestructingSolverStorable77,SelfDestructingSolverStorable78,SelfDestructingSolverStorable79 [2024-05-07 01:23:38,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:38,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1464070939, now seen corresponding path program 1 times [2024-05-07 01:23:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:38,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928508308] [2024-05-07 01:23:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:38,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:38,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:38,720 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:38,720 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:38,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:38,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-05-07 01:23:38,721 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:38,721 WARN L233 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:38,721 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-05-07 01:23:38,760 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-05-07 01:23:38,764 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:38,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:38,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:38,768 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-07 01:23:38,774 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:38,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:38,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:38,774 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:38,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:38,783 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-07 01:23:38,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:38,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -418205769, now seen corresponding path program 1 times [2024-05-07 01:23:38,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497246056] [2024-05-07 01:23:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-05-07 01:23:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497246056] [2024-05-07 01:23:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497246056] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:38,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742376885] [2024-05-07 01:23:38,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:38,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:38,850 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:38,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 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-07 01:23:38,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:38,920 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:38,920 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 514 treesize of output 466 [2024-05-07 01:23:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 1 times [2024-05-07 01:23:38,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:38,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:39,058 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:39,058 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 270 treesize of output 246 [2024-05-07 01:23:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 731616166, now seen corresponding path program 1 times [2024-05-07 01:23:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:39,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:39,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:39,439 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:39,439 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 1046 treesize of output 946 [2024-05-07 01:23:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 2 times [2024-05-07 01:23:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:39,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:39,647 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:39,647 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 1046 treesize of output 946 [2024-05-07 01:23:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash -996485954, now seen corresponding path program 1 times [2024-05-07 01:23:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:39,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:39,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:40,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:40,304 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:40,304 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 522 treesize of output 470 [2024-05-07 01:23:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 3 times [2024-05-07 01:23:40,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:40,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:41,967 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:23:41,968 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 511 treesize of output 489 [2024-05-07 01:23:41,983 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:23:41,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 69 [2024-05-07 01:23:42,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1907340383, now seen corresponding path program 1 times [2024-05-07 01:23:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:42,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:42,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:42,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:42,885 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:42,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 01:23:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -558856403, now seen corresponding path program 4 times [2024-05-07 01:23:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:43,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:44,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable94,SelfDestructingSolverStorable84,SelfDestructingSolverStorable95,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable88,SelfDestructingSolverStorable89 [2024-05-07 01:23:44,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:44,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -258648329, now seen corresponding path program 1 times [2024-05-07 01:23:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622820683] [2024-05-07 01:23:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:44,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:44,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:44,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:44,206 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:44,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:44,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:44,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-05-07 01:23:44,208 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:44,208 WARN L233 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:44,208 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-05-07 01:23:44,249 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-05-07 01:23:44,253 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:44,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:44,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:44,260 INFO L229 MonitoredProcess]: Starting monitored process 12 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-07 01:23:44,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2024-05-07 01:23:44,266 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:44,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:44,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:44,267 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:44,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:44,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:44,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash -823150632, now seen corresponding path program 1 times [2024-05-07 01:23:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921723698] [2024-05-07 01:23:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:44,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-05-07 01:23:44,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921723698] [2024-05-07 01:23:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921723698] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:44,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:44,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:44,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067521009] [2024-05-07 01:23:44,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:44,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:44,354 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:44,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 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-07 01:23:44,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:44,438 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:44,439 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 270 treesize of output 246 [2024-05-07 01:23:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 1 times [2024-05-07 01:23:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:44,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:44,579 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:44,580 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 288 treesize of output 264 [2024-05-07 01:23:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash -958119808, now seen corresponding path program 1 times [2024-05-07 01:23:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:44,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:44,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:44,969 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:44,970 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 522 treesize of output 470 [2024-05-07 01:23:45,014 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 2 times [2024-05-07 01:23:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:45,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:45,174 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:45,175 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 576 treesize of output 524 [2024-05-07 01:23:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1442743236, now seen corresponding path program 1 times [2024-05-07 01:23:45,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:45,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:45,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:45,669 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:45,670 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 558 treesize of output 506 [2024-05-07 01:23:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 3 times [2024-05-07 01:23:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:45,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:47,010 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 500 treesize of output 452 [2024-05-07 01:23:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1841006416, now seen corresponding path program 1 times [2024-05-07 01:23:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:47,876 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:47,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:23:47,920 INFO L85 PathProgramCache]: Analyzing trace with hash 75617273, now seen corresponding path program 4 times [2024-05-07 01:23:47,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:47,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:49,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,SelfDestructingSolverStorable97,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103 [2024-05-07 01:23:49,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:49,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash -641492752, now seen corresponding path program 1 times [2024-05-07 01:23:49,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:49,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430913100] [2024-05-07 01:23:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:49,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:49,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:49,209 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:49,209 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:49,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:49,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-05-07 01:23:49,210 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:49,211 WARN L233 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:49,211 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-05-07 01:23:49,256 INFO L144 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-05-07 01:23:49,260 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:49,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:49,262 INFO L229 MonitoredProcess]: Starting monitored process 13 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-07 01:23:49,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-05-07 01:23:49,265 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:49,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:49,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:49,266 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:49,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:49,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:49,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1761542938, now seen corresponding path program 1 times [2024-05-07 01:23:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:49,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599014734] [2024-05-07 01:23:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-05-07 01:23:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599014734] [2024-05-07 01:23:49,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599014734] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:49,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:49,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795372893] [2024-05-07 01:23:49,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:49,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:49,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:49,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:49,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:49,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:49,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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-07 01:23:49,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:49,444 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:49,445 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 270 treesize of output 246 [2024-05-07 01:23:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 1 times [2024-05-07 01:23:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:49,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:49,576 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:49,576 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 514 treesize of output 466 [2024-05-07 01:23:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 976439920, now seen corresponding path program 1 times [2024-05-07 01:23:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:49,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:49,901 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:49,901 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 522 treesize of output 470 [2024-05-07 01:23:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 2 times [2024-05-07 01:23:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:49,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:50,082 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:50,083 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 558 treesize of output 506 [2024-05-07 01:23:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash 630836128, now seen corresponding path program 1 times [2024-05-07 01:23:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:50,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:50,809 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:50,810 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 278 treesize of output 250 [2024-05-07 01:23:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 3 times [2024-05-07 01:23:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:50,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:51,475 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:23:51,476 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 270 treesize of output 260 [2024-05-07 01:23:51,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:23:51,489 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 62 treesize of output 62 [2024-05-07 01:23:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash -781338354, now seen corresponding path program 1 times [2024-05-07 01:23:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:51,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:51,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:52,068 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:52,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:23:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -462922623, now seen corresponding path program 4 times [2024-05-07 01:23:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:52,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:53,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,SelfDestructingSolverStorable110,SelfDestructingSolverStorable121,SelfDestructingSolverStorable119,SelfDestructingSolverStorable115,SelfDestructingSolverStorable116,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-05-07 01:23:53,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:53,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 780438645, now seen corresponding path program 1 times [2024-05-07 01:23:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988437390] [2024-05-07 01:23:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:53,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:53,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:53,698 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:53,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:53,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-05-07 01:23:53,700 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:53,700 WARN L233 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:53,700 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-05-07 01:23:53,759 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-05-07 01:23:53,769 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:53,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:53,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:53,772 INFO L229 MonitoredProcess]: Starting monitored process 14 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-07 01:23:53,778 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:53,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:53,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:53,779 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:53,779 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:53,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (14)] Waiting until timeout for monitored process [2024-05-07 01:23:53,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:53,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1157455677, now seen corresponding path program 1 times [2024-05-07 01:23:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147032154] [2024-05-07 01:23:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2024-05-07 01:23:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147032154] [2024-05-07 01:23:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147032154] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997810797] [2024-05-07 01:23:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:53,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:53,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:53,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:53,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 140.0) internal successors, (280), 2 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-07 01:23:53,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:53,956 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 262 treesize of output 238 [2024-05-07 01:23:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 1 times [2024-05-07 01:23:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:54,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:54,085 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:54,086 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 550 treesize of output 502 [2024-05-07 01:23:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1800949513, now seen corresponding path program 1 times [2024-05-07 01:23:54,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:54,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:54,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:54,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:54,395 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:54,395 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 550 treesize of output 498 [2024-05-07 01:23:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 2 times [2024-05-07 01:23:54,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:54,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:54,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:54,569 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:54,569 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 1046 treesize of output 946 [2024-05-07 01:23:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1604072422, now seen corresponding path program 1 times [2024-05-07 01:23:54,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:54,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:55,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:55,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:23:55,230 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:23:55,231 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 296 treesize of output 268 [2024-05-07 01:23:55,266 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 3 times [2024-05-07 01:23:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:55,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:55,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:56,088 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 500 treesize of output 452 [2024-05-07 01:23:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1646862546, now seen corresponding path program 1 times [2024-05-07 01:23:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:23:56,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:23:56,714 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:23:56,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 268 [2024-05-07 01:23:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -451625512, now seen corresponding path program 4 times [2024-05-07 01:23:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:56,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:23:56,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:23:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,SelfDestructingSolverStorable132,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,SelfDestructingSolverStorable133,SelfDestructingSolverStorable123,SelfDestructingSolverStorable134,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125 [2024-05-07 01:23:58,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:58,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1367140902, now seen corresponding path program 1 times [2024-05-07 01:23:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132735810] [2024-05-07 01:23:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:58,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:58,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:23:58,601 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:23:58,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:23:58,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:23:58,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-05-07 01:23:58,603 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:23:58,603 WARN L233 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:23:58,603 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-05-07 01:23:58,662 INFO L144 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-05-07 01:23:58,667 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:23:58,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:23:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:23:58,674 INFO L229 MonitoredProcess]: Starting monitored process 15 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-07 01:23:58,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-05-07 01:23:58,678 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:23:58,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:58,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:23:58,679 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:23:58,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:23:58,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:23:58,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:23:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 670108161, now seen corresponding path program 1 times [2024-05-07 01:23:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:23:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936108178] [2024-05-07 01:23:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2024-05-07 01:23:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:23:58,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936108178] [2024-05-07 01:23:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936108178] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:23:58,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:23:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:23:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879745548] [2024-05-07 01:23:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:23:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:23:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:23:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:23:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:23:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:58,821 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:23:58,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 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-07 01:23:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:23:58,893 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:23:58,893 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 288 treesize of output 264 [2024-05-07 01:23:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 1 times [2024-05-07 01:23:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:58,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:59,031 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 542 treesize of output 494 [2024-05-07 01:23:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 32894582, now seen corresponding path program 1 times [2024-05-07 01:23:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:59,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:59,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:23:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:23:59,398 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:59,398 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 270 treesize of output 242 [2024-05-07 01:23:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 2 times [2024-05-07 01:23:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:59,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:23:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:23:59,588 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:23:59,588 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 270 treesize of output 242 [2024-05-07 01:23:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash -922430147, now seen corresponding path program 1 times [2024-05-07 01:23:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:59,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:23:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:23:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:23:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:23:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:00,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:00,141 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:00,141 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 270 treesize of output 242 [2024-05-07 01:24:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 3 times [2024-05-07 01:24:00,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:00,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:00,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:00,833 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 547 treesize of output 525 [2024-05-07 01:24:00,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-05-07 01:24:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 207792315, now seen corresponding path program 1 times [2024-05-07 01:24:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:01,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:01,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:01,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:01,346 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:01,346 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 514 treesize of output 462 [2024-05-07 01:24:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash -11486914, now seen corresponding path program 4 times [2024-05-07 01:24:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:01,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:01,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:03,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,SelfDestructingSolverStorable141,SelfDestructingSolverStorable142,SelfDestructingSolverStorable143,SelfDestructingSolverStorable137,SelfDestructingSolverStorable138,SelfDestructingSolverStorable139,SelfDestructingSolverStorable144,SelfDestructingSolverStorable145,SelfDestructingSolverStorable146,SelfDestructingSolverStorable136,SelfDestructingSolverStorable147 [2024-05-07 01:24:03,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:03,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash -872388724, now seen corresponding path program 1 times [2024-05-07 01:24:03,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:03,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552450384] [2024-05-07 01:24:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:03,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:03,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:03,251 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:03,251 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-05-07 01:24:03,253 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:03,253 WARN L233 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:03,253 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-05-07 01:24:03,304 INFO L144 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-05-07 01:24:03,308 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:03,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:03,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:03,324 INFO L229 MonitoredProcess]: Starting monitored process 16 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-07 01:24:03,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2024-05-07 01:24:03,327 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:03,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:03,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:03,327 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:03,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:03,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:03,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2097414182, now seen corresponding path program 1 times [2024-05-07 01:24:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456408280] [2024-05-07 01:24:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2024-05-07 01:24:03,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:03,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456408280] [2024-05-07 01:24:03,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456408280] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:03,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635352112] [2024-05-07 01:24:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:03,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:03,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:03,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:03,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 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-07 01:24:03,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:03,539 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:03,539 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 532 treesize of output 484 [2024-05-07 01:24:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 1 times [2024-05-07 01:24:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:03,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:03,665 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:03,666 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 514 treesize of output 466 [2024-05-07 01:24:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 765745012, now seen corresponding path program 1 times [2024-05-07 01:24:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:03,974 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:03,975 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 540 treesize of output 488 [2024-05-07 01:24:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 2 times [2024-05-07 01:24:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:04,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:04,128 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:04,129 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 558 treesize of output 506 [2024-05-07 01:24:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1792353008, now seen corresponding path program 1 times [2024-05-07 01:24:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:04,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:04,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:04,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:04,645 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:04,646 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 1038 treesize of output 938 [2024-05-07 01:24:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 3 times [2024-05-07 01:24:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:04,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:05,232 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:05,233 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 1029 treesize of output 983 [2024-05-07 01:24:05,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-05-07 01:24:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1777927551, now seen corresponding path program 1 times [2024-05-07 01:24:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:05,928 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:24:05,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 01:24:06,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1675497041, now seen corresponding path program 4 times [2024-05-07 01:24:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:06,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:07,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,SelfDestructingSolverStorable152,SelfDestructingSolverStorable153,SelfDestructingSolverStorable154,SelfDestructingSolverStorable160,SelfDestructingSolverStorable150,SelfDestructingSolverStorable159,SelfDestructingSolverStorable149,SelfDestructingSolverStorable155,SelfDestructingSolverStorable156,SelfDestructingSolverStorable157,SelfDestructingSolverStorable158 [2024-05-07 01:24:07,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:07,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash -670266702, now seen corresponding path program 1 times [2024-05-07 01:24:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476574321] [2024-05-07 01:24:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:07,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:08,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:08,000 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:08,000 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:08,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:08,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-05-07 01:24:08,002 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:08,002 WARN L233 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:08,002 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-05-07 01:24:08,063 INFO L144 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-05-07 01:24:08,067 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:08,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:08,070 INFO L229 MonitoredProcess]: Starting monitored process 17 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-07 01:24:08,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-05-07 01:24:08,073 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:08,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:08,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:08,074 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:08,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:08,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:08,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:08,118 INFO L85 PathProgramCache]: Analyzing trace with hash -502552212, now seen corresponding path program 1 times [2024-05-07 01:24:08,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:08,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817412875] [2024-05-07 01:24:08,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:08,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2024-05-07 01:24:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:08,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817412875] [2024-05-07 01:24:08,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817412875] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:08,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:08,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:08,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327697684] [2024-05-07 01:24:08,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:08,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:08,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:08,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:08,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:08,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-07 01:24:08,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:08,246 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:08,246 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 288 treesize of output 264 [2024-05-07 01:24:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 1 times [2024-05-07 01:24:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:08,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:08,374 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 506 treesize of output 458 [2024-05-07 01:24:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1679646221, now seen corresponding path program 1 times [2024-05-07 01:24:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:08,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:08,839 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:08,839 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 576 treesize of output 524 [2024-05-07 01:24:08,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 2 times [2024-05-07 01:24:08,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:08,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:08,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:09,031 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:09,032 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 540 treesize of output 488 [2024-05-07 01:24:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -634120102, now seen corresponding path program 1 times [2024-05-07 01:24:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:09,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:09,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:09,587 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:09,587 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 1064 treesize of output 964 [2024-05-07 01:24:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 3 times [2024-05-07 01:24:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:09,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:10,201 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 500 treesize of output 452 [2024-05-07 01:24:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash 652394519, now seen corresponding path program 1 times [2024-05-07 01:24:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:10,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:10,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:10,732 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:10,732 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 270 treesize of output 242 [2024-05-07 01:24:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1639577912, now seen corresponding path program 4 times [2024-05-07 01:24:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:10,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:12,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,SelfDestructingSolverStorable173,SelfDestructingSolverStorable163,SelfDestructingSolverStorable164,SelfDestructingSolverStorable165,SelfDestructingSolverStorable170,SelfDestructingSolverStorable171,SelfDestructingSolverStorable172,SelfDestructingSolverStorable166,SelfDestructingSolverStorable167,SelfDestructingSolverStorable168,SelfDestructingSolverStorable169 [2024-05-07 01:24:12,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:12,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1122064708, now seen corresponding path program 1 times [2024-05-07 01:24:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951919808] [2024-05-07 01:24:12,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:12,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:12,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:13,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:13,116 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:13,116 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:13,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:13,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2024-05-07 01:24:13,117 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:13,117 WARN L233 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:13,117 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-05-07 01:24:13,184 INFO L144 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-05-07 01:24:13,189 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:13,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:13,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:13,192 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-07 01:24:13,197 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:13,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:13,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:13,198 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:13,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:13,215 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-07 01:24:13,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:13,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1875717485, now seen corresponding path program 1 times [2024-05-07 01:24:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131041618] [2024-05-07 01:24:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2024-05-07 01:24:13,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:13,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131041618] [2024-05-07 01:24:13,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131041618] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:13,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:13,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838709370] [2024-05-07 01:24:13,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:13,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:13,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:13,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:13,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:13,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.0) internal successors, (356), 2 states have internal predecessors, (356), 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-07 01:24:13,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:13,386 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 542 treesize of output 494 [2024-05-07 01:24:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 1 times [2024-05-07 01:24:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:13,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:13,526 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:13,526 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 514 treesize of output 466 [2024-05-07 01:24:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -738934243, now seen corresponding path program 1 times [2024-05-07 01:24:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:13,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:13,833 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:13,833 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 540 treesize of output 488 [2024-05-07 01:24:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 2 times [2024-05-07 01:24:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:13,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:14,007 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:14,007 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 278 treesize of output 250 [2024-05-07 01:24:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash 449453041, now seen corresponding path program 1 times [2024-05-07 01:24:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:14,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:14,511 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:14,512 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 576 treesize of output 524 [2024-05-07 01:24:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 3 times [2024-05-07 01:24:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:14,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:15,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:15,170 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 270 treesize of output 260 [2024-05-07 01:24:15,332 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:15,333 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 62 treesize of output 62 [2024-05-07 01:24:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1490970184, now seen corresponding path program 1 times [2024-05-07 01:24:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:15,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:15,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:15,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:15,849 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:15,849 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 270 treesize of output 242 [2024-05-07 01:24:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -592204683, now seen corresponding path program 4 times [2024-05-07 01:24:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:15,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:18,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184,SelfDestructingSolverStorable185,SelfDestructingSolverStorable175,SelfDestructingSolverStorable186,SelfDestructingSolverStorable176,SelfDestructingSolverStorable180,SelfDestructingSolverStorable181,SelfDestructingSolverStorable182,SelfDestructingSolverStorable183,SelfDestructingSolverStorable177,SelfDestructingSolverStorable178,SelfDestructingSolverStorable179 [2024-05-07 01:24:18,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:18,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash -4517571, now seen corresponding path program 1 times [2024-05-07 01:24:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:18,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875816390] [2024-05-07 01:24:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:18,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:18,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:18,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:18,325 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:18,325 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:18,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:18,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2024-05-07 01:24:18,328 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:18,329 WARN L233 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:18,329 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-05-07 01:24:18,391 INFO L144 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-05-07 01:24:18,395 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:18,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:18,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:18,396 INFO L229 MonitoredProcess]: Starting monitored process 19 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-07 01:24:18,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2024-05-07 01:24:18,400 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:18,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:18,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:18,401 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:18,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:18,460 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:18,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 763122267, now seen corresponding path program 1 times [2024-05-07 01:24:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785576257] [2024-05-07 01:24:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:18,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2024-05-07 01:24:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785576257] [2024-05-07 01:24:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785576257] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:18,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:18,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141550465] [2024-05-07 01:24:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:18,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 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-07 01:24:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:18,735 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 262 treesize of output 238 [2024-05-07 01:24:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 1 times [2024-05-07 01:24:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:18,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:18,864 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:18,865 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 514 treesize of output 466 [2024-05-07 01:24:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash -285743769, now seen corresponding path program 1 times [2024-05-07 01:24:18,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:18,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:19,176 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:19,176 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 540 treesize of output 488 [2024-05-07 01:24:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 2 times [2024-05-07 01:24:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:19,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:19,338 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:19,338 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 558 treesize of output 506 [2024-05-07 01:24:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1900462740, now seen corresponding path program 1 times [2024-05-07 01:24:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:19,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:19,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:19,761 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:19,761 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 270 treesize of output 242 [2024-05-07 01:24:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 3 times [2024-05-07 01:24:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:19,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:20,327 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 536 treesize of output 488 [2024-05-07 01:24:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1539220296, now seen corresponding path program 1 times [2024-05-07 01:24:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:20,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:20,863 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:20,863 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 1038 treesize of output 938 [2024-05-07 01:24:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1107156760, now seen corresponding path program 4 times [2024-05-07 01:24:20,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:20,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:23,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:23,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,SelfDestructingSolverStorable196,SelfDestructingSolverStorable197,SelfDestructingSolverStorable198,SelfDestructingSolverStorable191,SelfDestructingSolverStorable192,SelfDestructingSolverStorable193,SelfDestructingSolverStorable194,SelfDestructingSolverStorable190,SelfDestructingSolverStorable188,SelfDestructingSolverStorable199,SelfDestructingSolverStorable189 [2024-05-07 01:24:23,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:23,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -621914110, now seen corresponding path program 1 times [2024-05-07 01:24:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11541660] [2024-05-07 01:24:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:23,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:23,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:23,675 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:23,676 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:23,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:23,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2024-05-07 01:24:23,677 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:23,677 WARN L233 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:23,677 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-05-07 01:24:23,752 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-05-07 01:24:23,757 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:23,764 INFO L229 MonitoredProcess]: Starting monitored process 20 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-07 01:24:23,770 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:23,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:23,771 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:23,771 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:23,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:23,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2024-05-07 01:24:23,858 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:23,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1659575940, now seen corresponding path program 1 times [2024-05-07 01:24:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608993961] [2024-05-07 01:24:23,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:23,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2024-05-07 01:24:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608993961] [2024-05-07 01:24:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608993961] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785173556] [2024-05-07 01:24:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:23,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:23,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:23,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:23,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:23,934 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:23,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 197.0) internal successors, (394), 2 states have internal predecessors, (394), 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-07 01:24:23,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:24,001 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:24,002 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 1056 treesize of output 960 [2024-05-07 01:24:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 1 times [2024-05-07 01:24:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:24,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:24,131 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:24,131 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 270 treesize of output 246 [2024-05-07 01:24:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash -483028577, now seen corresponding path program 1 times [2024-05-07 01:24:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:24,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:24,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:24,440 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:24,440 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 540 treesize of output 488 [2024-05-07 01:24:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 2 times [2024-05-07 01:24:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:24,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:24,611 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:24,612 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 558 treesize of output 506 [2024-05-07 01:24:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash -619972799, now seen corresponding path program 1 times [2024-05-07 01:24:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:24,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:24,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:25,107 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:25,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 1038 treesize of output 938 [2024-05-07 01:24:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 3 times [2024-05-07 01:24:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:25,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:25,894 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 1018 treesize of output 922 [2024-05-07 01:24:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash -569047676, now seen corresponding path program 1 times [2024-05-07 01:24:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:26,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:26,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:26,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:26,421 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:24:26,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 540 treesize of output 488 [2024-05-07 01:24:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 13416027, now seen corresponding path program 4 times [2024-05-07 01:24:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,SelfDestructingSolverStorable208,SelfDestructingSolverStorable209,SelfDestructingSolverStorable203,SelfDestructingSolverStorable204,SelfDestructingSolverStorable205,SelfDestructingSolverStorable206,SelfDestructingSolverStorable210,SelfDestructingSolverStorable211,SelfDestructingSolverStorable201,SelfDestructingSolverStorable212,SelfDestructingSolverStorable202 [2024-05-07 01:24:29,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:29,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash 899274044, now seen corresponding path program 1 times [2024-05-07 01:24:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064547038] [2024-05-07 01:24:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:29,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:29,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:29,651 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:29,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:29,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:29,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2024-05-07 01:24:29,652 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:29,652 WARN L233 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:29,653 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-05-07 01:24:29,723 INFO L144 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-05-07 01:24:29,728 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:29,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:29,736 INFO L229 MonitoredProcess]: Starting monitored process 21 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-07 01:24:29,742 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:29,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:29,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:29,742 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:29,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:29,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-05-07 01:24:29,863 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:29,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:29,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2030356530, now seen corresponding path program 1 times [2024-05-07 01:24:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:29,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213537445] [2024-05-07 01:24:29,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2024-05-07 01:24:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213537445] [2024-05-07 01:24:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213537445] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369367344] [2024-05-07 01:24:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:29,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:29,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:29,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 206.5) internal successors, (413), 2 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-07 01:24:29,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:30,080 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:30,081 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 514 treesize of output 466 [2024-05-07 01:24:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 1 times [2024-05-07 01:24:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:30,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:30,237 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:30,237 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 514 treesize of output 466 [2024-05-07 01:24:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -917424178, now seen corresponding path program 1 times [2024-05-07 01:24:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:30,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:30,565 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:30,566 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 278 treesize of output 250 [2024-05-07 01:24:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 2 times [2024-05-07 01:24:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:30,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:30,722 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:30,722 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 1046 treesize of output 946 [2024-05-07 01:24:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash 284344936, now seen corresponding path program 1 times [2024-05-07 01:24:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:31,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:31,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:31,251 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:31,252 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 278 treesize of output 250 [2024-05-07 01:24:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 3 times [2024-05-07 01:24:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:31,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:31,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:31,939 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 1029 treesize of output 983 [2024-05-07 01:24:31,952 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:31,953 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 43 treesize of output 43 [2024-05-07 01:24:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2042256956, now seen corresponding path program 1 times [2024-05-07 01:24:31,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:32,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:32,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:32,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:32,453 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:24:32,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 01:24:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1437549819, now seen corresponding path program 4 times [2024-05-07 01:24:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:32,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:32,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:35,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220,SelfDestructingSolverStorable218,SelfDestructingSolverStorable219,SelfDestructingSolverStorable214,SelfDestructingSolverStorable225,SelfDestructingSolverStorable215,SelfDestructingSolverStorable216,SelfDestructingSolverStorable217,SelfDestructingSolverStorable221,SelfDestructingSolverStorable222,SelfDestructingSolverStorable223,SelfDestructingSolverStorable224 [2024-05-07 01:24:35,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:35,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -955992696, now seen corresponding path program 1 times [2024-05-07 01:24:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:35,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344281292] [2024-05-07 01:24:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:35,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:35,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:35,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:35,700 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:35,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:35,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:35,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2024-05-07 01:24:35,701 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:35,702 WARN L233 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:35,702 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-05-07 01:24:35,794 INFO L144 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-05-07 01:24:35,800 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:35,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:35,803 INFO L229 MonitoredProcess]: Starting monitored process 22 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-07 01:24:35,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2024-05-07 01:24:35,810 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:35,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:35,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:35,811 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:35,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:35,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:35,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -21885191, now seen corresponding path program 1 times [2024-05-07 01:24:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469705327] [2024-05-07 01:24:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2024-05-07 01:24:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469705327] [2024-05-07 01:24:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469705327] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:36,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402263770] [2024-05-07 01:24:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:36,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:36,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:36,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:36,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:36,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 216.0) internal successors, (432), 2 states have internal predecessors, (432), 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-07 01:24:36,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:36,235 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 262 treesize of output 238 [2024-05-07 01:24:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 1 times [2024-05-07 01:24:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:36,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:36,382 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:36,382 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 550 treesize of output 502 [2024-05-07 01:24:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1336319221, now seen corresponding path program 1 times [2024-05-07 01:24:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:36,796 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:36,796 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 540 treesize of output 488 [2024-05-07 01:24:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 2 times [2024-05-07 01:24:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:36,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:36,993 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:36,993 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 576 treesize of output 524 [2024-05-07 01:24:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 798626594, now seen corresponding path program 1 times [2024-05-07 01:24:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:37,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:37,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:37,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:37,462 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:37,463 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 1064 treesize of output 964 [2024-05-07 01:24:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 3 times [2024-05-07 01:24:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:37,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:38,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 259 treesize of output 235 [2024-05-07 01:24:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash 175304160, now seen corresponding path program 1 times [2024-05-07 01:24:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:39,086 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:24:39,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 01:24:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2005298084, now seen corresponding path program 4 times [2024-05-07 01:24:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:42,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230,SelfDestructingSolverStorable231,SelfDestructingSolverStorable229,SelfDestructingSolverStorable236,SelfDestructingSolverStorable237,SelfDestructingSolverStorable227,SelfDestructingSolverStorable238,SelfDestructingSolverStorable228,SelfDestructingSolverStorable232,SelfDestructingSolverStorable233,SelfDestructingSolverStorable234,SelfDestructingSolverStorable235 [2024-05-07 01:24:42,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:42,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1194800905, now seen corresponding path program 1 times [2024-05-07 01:24:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:42,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137480735] [2024-05-07 01:24:42,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:42,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:42,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:42,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:42,315 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:42,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:42,315 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:42,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2024-05-07 01:24:42,316 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:42,316 WARN L233 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:42,316 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-05-07 01:24:42,394 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-05-07 01:24:42,400 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:42,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:42,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:42,408 INFO L229 MonitoredProcess]: Starting monitored process 23 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-07 01:24:42,413 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:42,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:42,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:42,413 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:42,414 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:42,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (23)] Waiting until timeout for monitored process [2024-05-07 01:24:42,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:42,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1583902149, now seen corresponding path program 1 times [2024-05-07 01:24:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501086803] [2024-05-07 01:24:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2024-05-07 01:24:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501086803] [2024-05-07 01:24:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501086803] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:42,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846807667] [2024-05-07 01:24:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:42,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:42,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:42,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 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-07 01:24:42,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:42,845 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 506 treesize of output 458 [2024-05-07 01:24:42,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 1 times [2024-05-07 01:24:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:42,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:43,011 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:43,012 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 568 treesize of output 520 [2024-05-07 01:24:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1963771096, now seen corresponding path program 1 times [2024-05-07 01:24:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:43,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:43,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:43,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:43,311 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:43,311 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 540 treesize of output 488 [2024-05-07 01:24:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 2 times [2024-05-07 01:24:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:43,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:43,463 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:43,463 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 550 treesize of output 498 [2024-05-07 01:24:43,509 INFO L85 PathProgramCache]: Analyzing trace with hash -39034720, now seen corresponding path program 1 times [2024-05-07 01:24:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:43,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:43,928 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:43,929 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 576 treesize of output 524 [2024-05-07 01:24:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 3 times [2024-05-07 01:24:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:43,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:43,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:44,839 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 500 treesize of output 452 [2024-05-07 01:24:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1707099371, now seen corresponding path program 1 times [2024-05-07 01:24:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:45,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:45,581 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:45,581 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 270 treesize of output 242 [2024-05-07 01:24:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1462483853, now seen corresponding path program 4 times [2024-05-07 01:24:45,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:45,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:45,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:48,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,SelfDestructingSolverStorable240,SelfDestructingSolverStorable251,SelfDestructingSolverStorable241,SelfDestructingSolverStorable242,SelfDestructingSolverStorable247,SelfDestructingSolverStorable248,SelfDestructingSolverStorable249,SelfDestructingSolverStorable243,SelfDestructingSolverStorable244,SelfDestructingSolverStorable245,SelfDestructingSolverStorable246 [2024-05-07 01:24:48,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:48,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -614382253, now seen corresponding path program 1 times [2024-05-07 01:24:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286237607] [2024-05-07 01:24:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:49,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:49,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:49,466 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:49,466 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:49,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:49,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2024-05-07 01:24:49,467 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:49,468 WARN L233 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:49,468 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-05-07 01:24:49,571 INFO L144 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-05-07 01:24:49,577 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:49,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:49,581 INFO L229 MonitoredProcess]: Starting monitored process 24 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-07 01:24:49,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-05-07 01:24:49,585 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:49,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:49,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:49,586 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:49,587 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:49,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:49,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -441732622, now seen corresponding path program 1 times [2024-05-07 01:24:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:49,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595717927] [2024-05-07 01:24:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 2205 trivial. 0 not checked. [2024-05-07 01:24:49,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:49,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595717927] [2024-05-07 01:24:49,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595717927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:49,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:49,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360656921] [2024-05-07 01:24:49,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:49,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:49,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:49,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:49,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:49,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 235.0) internal successors, (470), 2 states have internal predecessors, (470), 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-07 01:24:49,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:49,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 262 treesize of output 238 [2024-05-07 01:24:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 1 times [2024-05-07 01:24:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:49,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:49,949 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:49,949 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 568 treesize of output 520 [2024-05-07 01:24:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1722577938, now seen corresponding path program 1 times [2024-05-07 01:24:49,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:50,289 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:50,289 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 1038 treesize of output 938 [2024-05-07 01:24:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 2 times [2024-05-07 01:24:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:50,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:50,511 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:50,512 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 296 treesize of output 268 [2024-05-07 01:24:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1196284032, now seen corresponding path program 1 times [2024-05-07 01:24:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:50,954 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:50,954 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 576 treesize of output 524 [2024-05-07 01:24:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 3 times [2024-05-07 01:24:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:51,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:51,762 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 259 treesize of output 235 [2024-05-07 01:24:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -220094733, now seen corresponding path program 1 times [2024-05-07 01:24:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:52,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:52,464 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:24:52,464 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 270 treesize of output 242 [2024-05-07 01:24:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash -931964823, now seen corresponding path program 4 times [2024-05-07 01:24:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:52,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:52,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:52,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:24:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:56,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261,SelfDestructingSolverStorable262,SelfDestructingSolverStorable263,SelfDestructingSolverStorable253,SelfDestructingSolverStorable264,SelfDestructingSolverStorable260,SelfDestructingSolverStorable258,SelfDestructingSolverStorable259,SelfDestructingSolverStorable254,SelfDestructingSolverStorable255,SelfDestructingSolverStorable256,SelfDestructingSolverStorable257 [2024-05-07 01:24:56,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:56,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1582696202, now seen corresponding path program 1 times [2024-05-07 01:24:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:56,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836473427] [2024-05-07 01:24:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:56,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:56,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:24:56,386 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:24:56,386 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:24:56,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:24:56,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2024-05-07 01:24:56,388 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:24:56,388 WARN L233 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:24:56,388 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-05-07 01:24:56,468 INFO L144 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-05-07 01:24:56,474 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:24:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:24:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:24:56,478 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-07 01:24:56,479 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-07 01:24:56,481 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:24:56,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:56,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:24:56,481 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:24:56,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:24:56,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:24:56,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:24:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -725831104, now seen corresponding path program 1 times [2024-05-07 01:24:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:24:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901008098] [2024-05-07 01:24:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2645 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2024-05-07 01:24:56,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:24:56,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901008098] [2024-05-07 01:24:56,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901008098] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:24:56,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:24:56,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:24:56,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166799803] [2024-05-07 01:24:56,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:24:56,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:24:56,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:24:56,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:24:56,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:24:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:56,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:24:56,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 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-07 01:24:56,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:24:56,792 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:56,792 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 270 treesize of output 246 [2024-05-07 01:24:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 1 times [2024-05-07 01:24:56,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:56,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:56,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:56,917 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:24:56,918 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 550 treesize of output 502 [2024-05-07 01:24:56,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1688408701, now seen corresponding path program 1 times [2024-05-07 01:24:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:56,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:57,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:24:57,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:24:57,214 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:57,215 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 1046 treesize of output 946 [2024-05-07 01:24:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 2 times [2024-05-07 01:24:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:57,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:57,371 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:57,371 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 558 treesize of output 506 [2024-05-07 01:24:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 587054909, now seen corresponding path program 1 times [2024-05-07 01:24:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:24:57,817 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:24:57,818 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 558 treesize of output 506 [2024-05-07 01:24:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 3 times [2024-05-07 01:24:57,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:58,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:24:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:24:58,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:58,619 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 270 treesize of output 260 [2024-05-07 01:24:58,630 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:24:58,630 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 62 treesize of output 62 [2024-05-07 01:24:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2021168845, now seen corresponding path program 1 times [2024-05-07 01:24:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:24:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:24:59,287 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:24:59,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 01:24:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2050928147, now seen corresponding path program 4 times [2024-05-07 01:24:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:24:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:24:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:24:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:24:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:24:59,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:03,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:03,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272,SelfDestructingSolverStorable273,SelfDestructingSolverStorable274,SelfDestructingSolverStorable275,SelfDestructingSolverStorable270,SelfDestructingSolverStorable271,SelfDestructingSolverStorable269,SelfDestructingSolverStorable276,SelfDestructingSolverStorable266,SelfDestructingSolverStorable277,SelfDestructingSolverStorable267,SelfDestructingSolverStorable268 [2024-05-07 01:25:03,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:03,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1570424267, now seen corresponding path program 1 times [2024-05-07 01:25:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602238783] [2024-05-07 01:25:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:03,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:03,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:03,686 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:03,686 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:03,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:03,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2024-05-07 01:25:03,688 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:03,688 WARN L233 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:03,688 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-05-07 01:25:03,770 INFO L144 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-05-07 01:25:03,776 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:03,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:03,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:03,778 INFO L229 MonitoredProcess]: Starting monitored process 26 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-07 01:25:03,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (26)] Waiting until timeout for monitored process [2024-05-07 01:25:03,781 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:03,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:03,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:03,782 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:03,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:03,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:03,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 463003247, now seen corresponding path program 1 times [2024-05-07 01:25:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623131572] [2024-05-07 01:25:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2880 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2024-05-07 01:25:04,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:04,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623131572] [2024-05-07 01:25:04,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623131572] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:04,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768795124] [2024-05-07 01:25:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:04,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:04,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:04,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 254.0) internal successors, (508), 2 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-07 01:25:04,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:04,125 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 506 treesize of output 458 [2024-05-07 01:25:04,152 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 1 times [2024-05-07 01:25:04,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:04,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:04,247 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:04,247 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 270 treesize of output 246 [2024-05-07 01:25:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -766961560, now seen corresponding path program 1 times [2024-05-07 01:25:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:04,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:04,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:04,568 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:04,569 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 540 treesize of output 488 [2024-05-07 01:25:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 2 times [2024-05-07 01:25:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:04,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:04,746 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:04,747 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 1046 treesize of output 946 [2024-05-07 01:25:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash 934232656, now seen corresponding path program 1 times [2024-05-07 01:25:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:05,346 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:25:05,346 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 514 treesize of output 462 [2024-05-07 01:25:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 3 times [2024-05-07 01:25:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:05,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:06,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 259 treesize of output 235 [2024-05-07 01:25:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 636283566, now seen corresponding path program 1 times [2024-05-07 01:25:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:06,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:06,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:25:06,721 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:25:06,721 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 1038 treesize of output 938 [2024-05-07 01:25:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 483653059, now seen corresponding path program 4 times [2024-05-07 01:25:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:25:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:11,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283,SelfDestructingSolverStorable284,SelfDestructingSolverStorable285,SelfDestructingSolverStorable286,SelfDestructingSolverStorable290,SelfDestructingSolverStorable280,SelfDestructingSolverStorable281,SelfDestructingSolverStorable282,SelfDestructingSolverStorable287,SelfDestructingSolverStorable288,SelfDestructingSolverStorable289,SelfDestructingSolverStorable279 [2024-05-07 01:25:11,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:11,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1075257918, now seen corresponding path program 1 times [2024-05-07 01:25:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209011944] [2024-05-07 01:25:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:11,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:11,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:11,754 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:11,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:11,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:11,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2024-05-07 01:25:11,755 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:11,755 WARN L233 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:11,755 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-05-07 01:25:11,842 INFO L144 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-05-07 01:25:11,849 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:11,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:11,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:11,854 INFO L229 MonitoredProcess]: Starting monitored process 27 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-07 01:25:11,857 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:11,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:11,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:11,858 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:11,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:11,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Waiting until timeout for monitored process [2024-05-07 01:25:12,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:12,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -432258753, now seen corresponding path program 1 times [2024-05-07 01:25:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:12,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973260488] [2024-05-07 01:25:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3125 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 2880 trivial. 0 not checked. [2024-05-07 01:25:12,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973260488] [2024-05-07 01:25:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973260488] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:12,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394806324] [2024-05-07 01:25:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:12,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:12,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:12,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 263.5) internal successors, (527), 2 states have internal predecessors, (527), 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-07 01:25:12,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:12,316 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:12,316 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 532 treesize of output 484 [2024-05-07 01:25:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 1 times [2024-05-07 01:25:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:12,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:12,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:12,447 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 1030 treesize of output 934 [2024-05-07 01:25:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2128946207, now seen corresponding path program 1 times [2024-05-07 01:25:12,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:12,759 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:25:12,760 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 270 treesize of output 242 [2024-05-07 01:25:12,818 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 2 times [2024-05-07 01:25:12,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:12,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:12,953 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:12,953 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 1064 treesize of output 964 [2024-05-07 01:25:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1598365671, now seen corresponding path program 1 times [2024-05-07 01:25:12,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:13,420 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:13,420 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 576 treesize of output 524 [2024-05-07 01:25:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 3 times [2024-05-07 01:25:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:13,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:14,309 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 500 treesize of output 452 [2024-05-07 01:25:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1466030969, now seen corresponding path program 1 times [2024-05-07 01:25:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:14,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:25:15,067 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:25:15,067 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 550 treesize of output 498 [2024-05-07 01:25:15,128 INFO L85 PathProgramCache]: Analyzing trace with hash 828309893, now seen corresponding path program 4 times [2024-05-07 01:25:15,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:15,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:25:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:19,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294,SelfDestructingSolverStorable295,SelfDestructingSolverStorable296,SelfDestructingSolverStorable297,SelfDestructingSolverStorable292,SelfDestructingSolverStorable293,SelfDestructingSolverStorable302,SelfDestructingSolverStorable303,SelfDestructingSolverStorable298,SelfDestructingSolverStorable299,SelfDestructingSolverStorable300,SelfDestructingSolverStorable301 [2024-05-07 01:25:19,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:19,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 139902914, now seen corresponding path program 1 times [2024-05-07 01:25:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995084863] [2024-05-07 01:25:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:19,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:19,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:20,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:20,133 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:20,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:20,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:20,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2024-05-07 01:25:20,135 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:20,135 WARN L233 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:20,135 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-05-07 01:25:20,222 INFO L144 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-05-07 01:25:20,227 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:20,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:20,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:20,236 INFO L229 MonitoredProcess]: Starting monitored process 28 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-07 01:25:20,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2024-05-07 01:25:20,238 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:20,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:20,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:20,238 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:20,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:20,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:20,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1075922032, now seen corresponding path program 1 times [2024-05-07 01:25:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:20,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681019635] [2024-05-07 01:25:20,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:20,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3380 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 3125 trivial. 0 not checked. [2024-05-07 01:25:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:20,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681019635] [2024-05-07 01:25:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681019635] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:20,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:20,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:20,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424928676] [2024-05-07 01:25:20,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:20,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:20,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:20,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:20,545 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:20,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 273.0) internal successors, (546), 2 states have internal predecessors, (546), 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-07 01:25:20,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:20,617 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:20,617 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 514 treesize of output 466 [2024-05-07 01:25:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 1 times [2024-05-07 01:25:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:20,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:20,864 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:20,865 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 270 treesize of output 246 [2024-05-07 01:25:20,895 INFO L85 PathProgramCache]: Analyzing trace with hash 444932525, now seen corresponding path program 1 times [2024-05-07 01:25:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:21,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:21,166 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:21,166 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 1046 treesize of output 946 [2024-05-07 01:25:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 2 times [2024-05-07 01:25:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:21,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:21,339 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:21,339 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 558 treesize of output 506 [2024-05-07 01:25:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash -257929323, now seen corresponding path program 1 times [2024-05-07 01:25:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:21,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:21,783 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:21,783 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 278 treesize of output 250 [2024-05-07 01:25:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 3 times [2024-05-07 01:25:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:21,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:22,374 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 536 treesize of output 488 [2024-05-07 01:25:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1146248409, now seen corresponding path program 1 times [2024-05-07 01:25:22,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:25:22,999 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:25:23,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 01:25:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1701432479, now seen corresponding path program 4 times [2024-05-07 01:25:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:23,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:23,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:25:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:27,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306,SelfDestructingSolverStorable307,SelfDestructingSolverStorable308,SelfDestructingSolverStorable309,SelfDestructingSolverStorable313,SelfDestructingSolverStorable314,SelfDestructingSolverStorable315,SelfDestructingSolverStorable305,SelfDestructingSolverStorable316,SelfDestructingSolverStorable310,SelfDestructingSolverStorable311,SelfDestructingSolverStorable312 [2024-05-07 01:25:27,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:27,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1115737976, now seen corresponding path program 1 times [2024-05-07 01:25:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104424478] [2024-05-07 01:25:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:27,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:28,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:28,433 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:28,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:28,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:28,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2024-05-07 01:25:28,435 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:28,435 WARN L233 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:28,435 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-05-07 01:25:28,533 INFO L144 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-05-07 01:25:28,540 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:28,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:28,545 INFO L229 MonitoredProcess]: Starting monitored process 29 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-07 01:25:28,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (29)] Waiting until timeout for monitored process [2024-05-07 01:25:28,548 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:28,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:28,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:28,549 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:28,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:28,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:28,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -912791102, now seen corresponding path program 1 times [2024-05-07 01:25:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652920766] [2024-05-07 01:25:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3645 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 3380 trivial. 0 not checked. [2024-05-07 01:25:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652920766] [2024-05-07 01:25:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652920766] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:28,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404873746] [2024-05-07 01:25:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:28,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:28,927 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:28,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 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-07 01:25:28,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:29,024 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:29,025 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 550 treesize of output 502 [2024-05-07 01:25:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 1 times [2024-05-07 01:25:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:29,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:29,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:29,192 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:29,193 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 1038 treesize of output 942 [2024-05-07 01:25:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1932115868, now seen corresponding path program 1 times [2024-05-07 01:25:29,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:29,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:29,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:29,531 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:29,531 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 278 treesize of output 250 [2024-05-07 01:25:29,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 2 times [2024-05-07 01:25:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:29,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:29,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:29,713 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:29,713 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 558 treesize of output 506 [2024-05-07 01:25:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1938525461, now seen corresponding path program 1 times [2024-05-07 01:25:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:30,309 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:30,310 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 1046 treesize of output 946 [2024-05-07 01:25:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 3 times [2024-05-07 01:25:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:30,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:30,916 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:25:30,917 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 547 treesize of output 525 [2024-05-07 01:25:30,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 01:25:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash 782947592, now seen corresponding path program 1 times [2024-05-07 01:25:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:31,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:25:31,430 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:25:31,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 01:25:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1714061332, now seen corresponding path program 4 times [2024-05-07 01:25:31,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:25:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:37,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328,SelfDestructingSolverStorable318,SelfDestructingSolverStorable329,SelfDestructingSolverStorable319,SelfDestructingSolverStorable324,SelfDestructingSolverStorable325,SelfDestructingSolverStorable326,SelfDestructingSolverStorable327,SelfDestructingSolverStorable320,SelfDestructingSolverStorable321,SelfDestructingSolverStorable322,SelfDestructingSolverStorable323 [2024-05-07 01:25:37,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:37,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1120628934, now seen corresponding path program 1 times [2024-05-07 01:25:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:37,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138684507] [2024-05-07 01:25:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:37,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:37,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:37,879 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:37,879 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:37,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:37,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2024-05-07 01:25:37,880 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:37,880 WARN L233 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:37,880 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-05-07 01:25:37,983 INFO L144 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-05-07 01:25:37,990 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:37,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:37,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:37,993 INFO L229 MonitoredProcess]: Starting monitored process 30 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-07 01:25:37,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2024-05-07 01:25:37,997 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:38,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:38,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:38,000 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:38,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:38,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:38,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 611263477, now seen corresponding path program 1 times [2024-05-07 01:25:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655263927] [2024-05-07 01:25:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3920 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 3645 trivial. 0 not checked. [2024-05-07 01:25:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:38,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655263927] [2024-05-07 01:25:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655263927] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968845766] [2024-05-07 01:25:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:38,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:38,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:38,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:38,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:38,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:38,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 292.0) internal successors, (584), 2 states have internal predecessors, (584), 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-07 01:25:38,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:38,573 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:38,573 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 550 treesize of output 502 [2024-05-07 01:25:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 1 times [2024-05-07 01:25:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:38,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:38,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:38,744 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:38,744 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 1038 treesize of output 942 [2024-05-07 01:25:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash 15490767, now seen corresponding path program 1 times [2024-05-07 01:25:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:38,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:39,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:39,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:39,174 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:39,175 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 558 treesize of output 506 [2024-05-07 01:25:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 2 times [2024-05-07 01:25:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:39,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:39,360 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:39,360 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 558 treesize of output 506 [2024-05-07 01:25:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash 121737935, now seen corresponding path program 1 times [2024-05-07 01:25:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:39,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:39,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:39,828 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:39,829 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 1046 treesize of output 946 [2024-05-07 01:25:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 3 times [2024-05-07 01:25:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:39,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:40,499 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 500 treesize of output 452 [2024-05-07 01:25:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash -625550593, now seen corresponding path program 1 times [2024-05-07 01:25:40,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:40,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:40,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:41,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:41,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:25:41,232 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:25:41,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:25:41,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2074337457, now seen corresponding path program 4 times [2024-05-07 01:25:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:41,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:25:41,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:47,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:47,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340,SelfDestructingSolverStorable341,SelfDestructingSolverStorable339,SelfDestructingSolverStorable335,SelfDestructingSolverStorable336,SelfDestructingSolverStorable337,SelfDestructingSolverStorable338,SelfDestructingSolverStorable331,SelfDestructingSolverStorable342,SelfDestructingSolverStorable332,SelfDestructingSolverStorable333,SelfDestructingSolverStorable334 [2024-05-07 01:25:47,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:47,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:47,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1779409552, now seen corresponding path program 1 times [2024-05-07 01:25:47,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:47,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698734845] [2024-05-07 01:25:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:47,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:48,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:48,031 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:48,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:48,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:48,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2024-05-07 01:25:48,032 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:48,032 WARN L233 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:48,032 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-05-07 01:25:48,149 INFO L144 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-05-07 01:25:48,156 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:48,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:48,168 INFO L229 MonitoredProcess]: Starting monitored process 31 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-07 01:25:48,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (31)] Waiting until timeout for monitored process [2024-05-07 01:25:48,174 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:48,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:48,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:48,174 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:48,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:48,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:48,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash 288370121, now seen corresponding path program 1 times [2024-05-07 01:25:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919630088] [2024-05-07 01:25:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:48,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4205 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2024-05-07 01:25:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:48,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919630088] [2024-05-07 01:25:48,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919630088] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:48,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:48,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527946875] [2024-05-07 01:25:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:48,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:48,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:48,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:48,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:48,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 301.5) internal successors, (603), 2 states have internal predecessors, (603), 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-07 01:25:48,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:48,581 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:48,581 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 532 treesize of output 484 [2024-05-07 01:25:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 1 times [2024-05-07 01:25:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:48,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:48,717 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:48,717 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 514 treesize of output 466 [2024-05-07 01:25:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash -268960699, now seen corresponding path program 1 times [2024-05-07 01:25:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:48,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:48,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:49,041 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:49,042 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 296 treesize of output 268 [2024-05-07 01:25:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 2 times [2024-05-07 01:25:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:49,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:49,213 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:25:49,213 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 1038 treesize of output 938 [2024-05-07 01:25:49,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1003300847, now seen corresponding path program 1 times [2024-05-07 01:25:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:49,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:49,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:49,807 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:49,808 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 296 treesize of output 268 [2024-05-07 01:25:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 3 times [2024-05-07 01:25:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:49,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:50,469 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:25:50,470 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 270 treesize of output 260 [2024-05-07 01:25:50,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:25:50,480 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 62 treesize of output 62 [2024-05-07 01:25:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash 657246285, now seen corresponding path program 1 times [2024-05-07 01:25:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:50,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:50,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:25:51,108 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:25:51,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 01:25:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -224086445, now seen corresponding path program 4 times [2024-05-07 01:25:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:51,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:25:51,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:25:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:57,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350,SelfDestructingSolverStorable351,SelfDestructingSolverStorable352,SelfDestructingSolverStorable346,SelfDestructingSolverStorable347,SelfDestructingSolverStorable348,SelfDestructingSolverStorable349,SelfDestructingSolverStorable353,SelfDestructingSolverStorable354,SelfDestructingSolverStorable344,SelfDestructingSolverStorable355,SelfDestructingSolverStorable345 [2024-05-07 01:25:57,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:57,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 263461453, now seen corresponding path program 1 times [2024-05-07 01:25:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:57,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494103658] [2024-05-07 01:25:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:57,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:57,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:25:57,738 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:25:57,738 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:25:57,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:25:57,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2024-05-07 01:25:57,739 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:25:57,739 WARN L233 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:25:57,739 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-05-07 01:25:57,836 INFO L144 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-05-07 01:25:57,843 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:25:57,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:25:57,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:25:57,851 INFO L229 MonitoredProcess]: Starting monitored process 32 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-07 01:25:57,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (32)] Waiting until timeout for monitored process [2024-05-07 01:25:57,853 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:25:57,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:57,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:25:57,853 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:25:57,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:25:58,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:25:58,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:25:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash 914807294, now seen corresponding path program 1 times [2024-05-07 01:25:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:25:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307266190] [2024-05-07 01:25:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 4205 trivial. 0 not checked. [2024-05-07 01:25:58,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:25:58,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307266190] [2024-05-07 01:25:58,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307266190] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:25:58,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:25:58,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:25:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332346068] [2024-05-07 01:25:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:25:58,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:25:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:25:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:25:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:25:58,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:58,332 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:25:58,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 311.0) internal successors, (622), 2 states have internal predecessors, (622), 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-07 01:25:58,332 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:25:58,398 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:58,399 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 270 treesize of output 246 [2024-05-07 01:25:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 1 times [2024-05-07 01:25:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:58,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:58,677 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:25:58,677 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 568 treesize of output 520 [2024-05-07 01:25:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1399982502, now seen corresponding path program 1 times [2024-05-07 01:25:58,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:25:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:25:58,987 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:58,987 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 522 treesize of output 470 [2024-05-07 01:25:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 2 times [2024-05-07 01:25:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:59,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:59,165 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:25:59,165 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 1038 treesize of output 938 [2024-05-07 01:25:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1871836018, now seen corresponding path program 1 times [2024-05-07 01:25:59,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:59,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:25:59,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:25:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:25:59,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:25:59,622 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:25:59,623 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 558 treesize of output 506 [2024-05-07 01:25:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 3 times [2024-05-07 01:25:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:25:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:25:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:25:59,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:25:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:00,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:26:00,267 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 270 treesize of output 260 [2024-05-07 01:26:00,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:26:00,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2024-05-07 01:26:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1573292627, now seen corresponding path program 1 times [2024-05-07 01:26:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:00,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:26:01,005 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:26:01,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 01:26:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash 450819349, now seen corresponding path program 4 times [2024-05-07 01:26:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:26:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:26:08,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:08,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360,SelfDestructingSolverStorable361,SelfDestructingSolverStorable362,SelfDestructingSolverStorable363,SelfDestructingSolverStorable357,SelfDestructingSolverStorable368,SelfDestructingSolverStorable358,SelfDestructingSolverStorable359,SelfDestructingSolverStorable364,SelfDestructingSolverStorable365,SelfDestructingSolverStorable366,SelfDestructingSolverStorable367 [2024-05-07 01:26:08,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:08,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:08,005 INFO L85 PathProgramCache]: Analyzing trace with hash 351451804, now seen corresponding path program 1 times [2024-05-07 01:26:08,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:08,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726832044] [2024-05-07 01:26:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:08,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:08,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:26:08,805 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:26:08,805 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:26:08,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:26:08,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2024-05-07 01:26:08,806 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:26:08,806 WARN L233 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:26:08,806 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-05-07 01:26:08,903 INFO L144 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-05-07 01:26:08,909 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:26:08,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:26:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:26:08,912 INFO L229 MonitoredProcess]: Starting monitored process 33 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-07 01:26:08,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (33)] Waiting until timeout for monitored process [2024-05-07 01:26:08,915 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:26:08,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:08,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:26:08,916 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:26:08,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:26:09,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:09,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 435660116, now seen corresponding path program 1 times [2024-05-07 01:26:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995349820] [2024-05-07 01:26:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4805 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 4500 trivial. 0 not checked. [2024-05-07 01:26:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:26:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995349820] [2024-05-07 01:26:09,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995349820] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:26:09,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:26:09,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:26:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021248540] [2024-05-07 01:26:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:26:09,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:26:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:26:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:26:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:26:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:09,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:26:09,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 320.5) internal successors, (641), 2 states have internal predecessors, (641), 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-07 01:26:09,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:09,533 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:09,533 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 532 treesize of output 484 [2024-05-07 01:26:09,573 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 1 times [2024-05-07 01:26:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:09,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:09,683 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:09,684 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 514 treesize of output 466 [2024-05-07 01:26:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 45840214, now seen corresponding path program 1 times [2024-05-07 01:26:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:09,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:09,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:26:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:26:10,008 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:10,009 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 540 treesize of output 488 [2024-05-07 01:26:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 2 times [2024-05-07 01:26:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:10,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:10,337 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:26:10,338 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 270 treesize of output 242 [2024-05-07 01:26:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash -703949777, now seen corresponding path program 1 times [2024-05-07 01:26:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:10,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:26:10,792 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:26:10,793 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 1038 treesize of output 938 [2024-05-07 01:26:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 3 times [2024-05-07 01:26:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:10,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:11,364 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 1018 treesize of output 922 [2024-05-07 01:26:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash 781762800, now seen corresponding path program 1 times [2024-05-07 01:26:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:11,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:26:11,909 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:26:11,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 01:26:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -540131060, now seen corresponding path program 4 times [2024-05-07 01:26:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:26:12,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:26:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:19,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371,SelfDestructingSolverStorable372,SelfDestructingSolverStorable373,SelfDestructingSolverStorable374,SelfDestructingSolverStorable380,SelfDestructingSolverStorable370,SelfDestructingSolverStorable381,SelfDestructingSolverStorable379,SelfDestructingSolverStorable375,SelfDestructingSolverStorable376,SelfDestructingSolverStorable377,SelfDestructingSolverStorable378 [2024-05-07 01:26:19,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:19,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1523806128, now seen corresponding path program 1 times [2024-05-07 01:26:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745441911] [2024-05-07 01:26:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:19,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:20,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:26:20,502 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:26:20,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:26:20,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:26:20,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2024-05-07 01:26:20,503 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:26:20,503 WARN L233 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:26:20,503 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-05-07 01:26:20,604 INFO L144 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-05-07 01:26:20,611 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:26:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:26:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:26:20,618 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-07 01:26:20,619 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-07 01:26:20,640 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:26:20,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:20,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:26:20,641 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:26:20,641 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:26:20,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:20,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2138701707, now seen corresponding path program 1 times [2024-05-07 01:26:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639146617] [2024-05-07 01:26:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5120 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 4805 trivial. 0 not checked. [2024-05-07 01:26:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:26:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639146617] [2024-05-07 01:26:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639146617] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:26:21,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:26:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:26:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139507880] [2024-05-07 01:26:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:26:21,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:26:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:26:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:26:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:26:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:21,135 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:26:21,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 330.0) internal successors, (660), 2 states have internal predecessors, (660), 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-07 01:26:21,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:21,198 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:21,199 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 270 treesize of output 246 [2024-05-07 01:26:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 1 times [2024-05-07 01:26:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:21,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:21,360 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:21,360 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 288 treesize of output 264 [2024-05-07 01:26:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2112354362, now seen corresponding path program 1 times [2024-05-07 01:26:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:26:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:26:21,670 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:21,670 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 522 treesize of output 470 [2024-05-07 01:26:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 2 times [2024-05-07 01:26:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:21,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:21,838 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:26:21,838 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 550 treesize of output 498 [2024-05-07 01:26:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -350505176, now seen corresponding path program 1 times [2024-05-07 01:26:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:26:22,485 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:22,485 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 522 treesize of output 470 [2024-05-07 01:26:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 3 times [2024-05-07 01:26:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:22,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:23,133 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 536 treesize of output 488 [2024-05-07 01:26:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1975441763, now seen corresponding path program 1 times [2024-05-07 01:26:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:23,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:26:23,868 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:26:23,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 558 treesize of output 506 [2024-05-07 01:26:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 307976887, now seen corresponding path program 4 times [2024-05-07 01:26:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:23,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:24,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:26:24,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:26:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:30,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393,SelfDestructingSolverStorable383,SelfDestructingSolverStorable394,SelfDestructingSolverStorable384,SelfDestructingSolverStorable385,SelfDestructingSolverStorable390,SelfDestructingSolverStorable391,SelfDestructingSolverStorable392,SelfDestructingSolverStorable386,SelfDestructingSolverStorable387,SelfDestructingSolverStorable388,SelfDestructingSolverStorable389 [2024-05-07 01:26:30,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:30,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1775503493, now seen corresponding path program 1 times [2024-05-07 01:26:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:30,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068849364] [2024-05-07 01:26:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:30,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:31,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:31,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:26:31,993 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:26:31,993 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:26:31,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:26:31,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2024-05-07 01:26:31,994 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:26:31,994 WARN L233 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:26:31,994 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-05-07 01:26:32,097 INFO L144 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-05-07 01:26:32,102 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:26:32,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:26:32,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:26:32,103 INFO L229 MonitoredProcess]: Starting monitored process 35 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-07 01:26:32,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (35)] Waiting until timeout for monitored process [2024-05-07 01:26:32,106 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:26:32,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:32,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:26:32,106 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:26:32,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:26:32,636 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:32,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1415258211, now seen corresponding path program 1 times [2024-05-07 01:26:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647406972] [2024-05-07 01:26:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5445 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 5120 trivial. 0 not checked. [2024-05-07 01:26:32,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:26:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647406972] [2024-05-07 01:26:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647406972] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:26:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:26:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:26:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316787498] [2024-05-07 01:26:32,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:26:32,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:26:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:26:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:26:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:26:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:32,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:26:32,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 339.5) internal successors, (679), 2 states have internal predecessors, (679), 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-07 01:26:32,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:32,873 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:32,873 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 514 treesize of output 466 [2024-05-07 01:26:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 1 times [2024-05-07 01:26:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:32,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:33,035 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:33,035 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 550 treesize of output 502 [2024-05-07 01:26:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1152791937, now seen corresponding path program 1 times [2024-05-07 01:26:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:33,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:26:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:26:33,341 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:33,342 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 1046 treesize of output 946 [2024-05-07 01:26:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 2 times [2024-05-07 01:26:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:33,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:33,519 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:33,519 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 558 treesize of output 506 [2024-05-07 01:26:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1991842716, now seen corresponding path program 1 times [2024-05-07 01:26:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:26:34,168 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:34,168 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 558 treesize of output 506 [2024-05-07 01:26:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 3 times [2024-05-07 01:26:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:34,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:34,771 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:26:34,771 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 1029 treesize of output 983 [2024-05-07 01:26:34,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-07 01:26:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash 868054748, now seen corresponding path program 1 times [2024-05-07 01:26:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:35,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:35,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:26:35,509 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:26:35,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 01:26:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 997650416, now seen corresponding path program 4 times [2024-05-07 01:26:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:35,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:26:35,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:26:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:44,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396,SelfDestructingSolverStorable405,SelfDestructingSolverStorable406,SelfDestructingSolverStorable407,SelfDestructingSolverStorable401,SelfDestructingSolverStorable402,SelfDestructingSolverStorable403,SelfDestructingSolverStorable404,SelfDestructingSolverStorable397,SelfDestructingSolverStorable398,SelfDestructingSolverStorable399,SelfDestructingSolverStorable400 [2024-05-07 01:26:44,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:44,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash 643388693, now seen corresponding path program 1 times [2024-05-07 01:26:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372305777] [2024-05-07 01:26:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:44,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:45,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:26:45,540 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:26:45,540 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:26:45,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:26:45,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2024-05-07 01:26:45,541 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:26:45,541 WARN L233 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:26:45,541 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-05-07 01:26:45,649 INFO L144 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2024-05-07 01:26:45,656 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:26:45,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:26:45,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:26:45,659 INFO L229 MonitoredProcess]: Starting monitored process 36 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-07 01:26:45,665 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:26:45,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:45,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:26:45,665 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:26:45,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:26:45,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (36)] Waiting until timeout for monitored process [2024-05-07 01:26:45,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:45,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:45,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1058312036, now seen corresponding path program 1 times [2024-05-07 01:26:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151119373] [2024-05-07 01:26:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5780 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2024-05-07 01:26:46,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:26:46,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151119373] [2024-05-07 01:26:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151119373] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:26:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:26:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:26:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385729530] [2024-05-07 01:26:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:26:46,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:26:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:26:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:26:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:26:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:46,175 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:26:46,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 349.0) internal successors, (698), 2 states have internal predecessors, (698), 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-07 01:26:46,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:46,239 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:46,239 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 550 treesize of output 502 [2024-05-07 01:26:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 1 times [2024-05-07 01:26:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:46,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:46,422 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:46,422 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 514 treesize of output 466 [2024-05-07 01:26:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1049347331, now seen corresponding path program 1 times [2024-05-07 01:26:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:46,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:46,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:26:46,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:26:46,800 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:46,801 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 522 treesize of output 470 [2024-05-07 01:26:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 2 times [2024-05-07 01:26:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:47,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:47,145 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:47,146 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 1046 treesize of output 946 [2024-05-07 01:26:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1752582634, now seen corresponding path program 1 times [2024-05-07 01:26:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:26:47,617 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:47,617 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 1046 treesize of output 946 [2024-05-07 01:26:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 3 times [2024-05-07 01:26:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:47,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:48,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:26:48,317 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 270 treesize of output 260 [2024-05-07 01:26:48,328 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:26:48,328 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 62 treesize of output 62 [2024-05-07 01:26:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 775528812, now seen corresponding path program 1 times [2024-05-07 01:26:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:48,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:48,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:48,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:26:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:26:49,068 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:26:49,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 01:26:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -725551858, now seen corresponding path program 4 times [2024-05-07 01:26:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:49,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:26:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:26:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:56,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409,SelfDestructingSolverStorable416,SelfDestructingSolverStorable417,SelfDestructingSolverStorable418,SelfDestructingSolverStorable419,SelfDestructingSolverStorable412,SelfDestructingSolverStorable413,SelfDestructingSolverStorable414,SelfDestructingSolverStorable415,SelfDestructingSolverStorable420,SelfDestructingSolverStorable410,SelfDestructingSolverStorable411 [2024-05-07 01:26:56,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:56,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash 424203717, now seen corresponding path program 1 times [2024-05-07 01:26:56,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:56,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108617840] [2024-05-07 01:26:56,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:57,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:58,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:26:58,025 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:26:58,026 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:26:58,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:26:58,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2024-05-07 01:26:58,026 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:26:58,026 WARN L233 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:26:58,026 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-05-07 01:26:58,138 INFO L144 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2024-05-07 01:26:58,145 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:26:58,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:26:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:26:58,148 INFO L229 MonitoredProcess]: Starting monitored process 37 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-07 01:26:58,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (37)] Waiting until timeout for monitored process [2024-05-07 01:26:58,151 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:26:58,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:58,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:26:58,151 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:26:58,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:26:58,373 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:26:58,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:26:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 502713078, now seen corresponding path program 1 times [2024-05-07 01:26:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:26:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040420062] [2024-05-07 01:26:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:58,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 5780 trivial. 0 not checked. [2024-05-07 01:26:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:26:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040420062] [2024-05-07 01:26:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040420062] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:26:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:26:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:26:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913483907] [2024-05-07 01:26:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:26:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:26:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:26:58,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:26:58,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:26:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:58,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:26:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 358.5) internal successors, (717), 2 states have internal predecessors, (717), 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-07 01:26:58,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:26:58,881 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:58,882 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 1038 treesize of output 942 [2024-05-07 01:26:58,933 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 1 times [2024-05-07 01:26:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:58,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:59,049 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:26:59,049 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 550 treesize of output 502 [2024-05-07 01:26:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1359317876, now seen corresponding path program 1 times [2024-05-07 01:26:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:59,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:59,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:26:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:26:59,511 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:59,512 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 1046 treesize of output 946 [2024-05-07 01:26:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 2 times [2024-05-07 01:26:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:59,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:26:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:26:59,760 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:26:59,760 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 1046 treesize of output 946 [2024-05-07 01:26:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1522293476, now seen corresponding path program 1 times [2024-05-07 01:26:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:26:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:26:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:26:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:26:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:27:00,233 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:00,233 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 1046 treesize of output 946 [2024-05-07 01:27:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 3 times [2024-05-07 01:27:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:00,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:00,888 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 1018 treesize of output 922 [2024-05-07 01:27:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1987502694, now seen corresponding path program 1 times [2024-05-07 01:27:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:27:01,513 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:27:01,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 01:27:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2002831805, now seen corresponding path program 4 times [2024-05-07 01:27:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:01,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:01,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:27:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:27:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:09,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427,SelfDestructingSolverStorable428,SelfDestructingSolverStorable429,SelfDestructingSolverStorable423,SelfDestructingSolverStorable424,SelfDestructingSolverStorable425,SelfDestructingSolverStorable426,SelfDestructingSolverStorable430,SelfDestructingSolverStorable431,SelfDestructingSolverStorable432,SelfDestructingSolverStorable422,SelfDestructingSolverStorable433 [2024-05-07 01:27:09,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:09,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1936575876, now seen corresponding path program 1 times [2024-05-07 01:27:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126455664] [2024-05-07 01:27:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:09,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:10,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:27:10,523 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:27:10,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:27:10,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:27:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2024-05-07 01:27:10,524 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:27:10,524 WARN L233 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:27:10,524 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-05-07 01:27:10,639 INFO L144 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2024-05-07 01:27:10,644 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:27:10,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:27:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:27:10,648 INFO L229 MonitoredProcess]: Starting monitored process 38 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-07 01:27:10,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (38)] Waiting until timeout for monitored process [2024-05-07 01:27:10,666 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:27:10,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:10,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:27:10,667 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:27:10,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:27:10,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:10,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -782151119, now seen corresponding path program 1 times [2024-05-07 01:27:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788352854] [2024-05-07 01:27:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 6125 trivial. 0 not checked. [2024-05-07 01:27:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:27:11,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788352854] [2024-05-07 01:27:11,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788352854] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:27:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:27:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:27:11,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556598397] [2024-05-07 01:27:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:27:11,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:27:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:27:11,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:27:11,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:27:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:11,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:27:11,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 368.0) internal successors, (736), 2 states have internal predecessors, (736), 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-07 01:27:11,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:11,194 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:27:11,194 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 1056 treesize of output 960 [2024-05-07 01:27:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 1 times [2024-05-07 01:27:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:11,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:11,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:11,362 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:27:11,362 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 568 treesize of output 520 [2024-05-07 01:27:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2076169755, now seen corresponding path program 1 times [2024-05-07 01:27:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:11,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:27:11,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:27:11,864 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:27:11,865 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 1038 treesize of output 938 [2024-05-07 01:27:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 2 times [2024-05-07 01:27:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:11,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:12,079 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:12,080 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 296 treesize of output 268 [2024-05-07 01:27:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1196374371, now seen corresponding path program 1 times [2024-05-07 01:27:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:27:12,724 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:12,725 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 296 treesize of output 268 [2024-05-07 01:27:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 3 times [2024-05-07 01:27:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:12,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:13,353 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 500 treesize of output 452 [2024-05-07 01:27:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 155312522, now seen corresponding path program 1 times [2024-05-07 01:27:13,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:13,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:27:13,915 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:27:13,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 01:27:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 790743281, now seen corresponding path program 4 times [2024-05-07 01:27:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:27:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:27:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440,SelfDestructingSolverStorable438,SelfDestructingSolverStorable439,SelfDestructingSolverStorable445,SelfDestructingSolverStorable435,SelfDestructingSolverStorable446,SelfDestructingSolverStorable436,SelfDestructingSolverStorable437,SelfDestructingSolverStorable441,SelfDestructingSolverStorable442,SelfDestructingSolverStorable443,SelfDestructingSolverStorable444 [2024-05-07 01:27:22,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:22,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2098220086, now seen corresponding path program 1 times [2024-05-07 01:27:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069060144] [2024-05-07 01:27:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:22,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:23,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:27:23,915 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:27:23,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:27:23,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:27:23,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2024-05-07 01:27:23,915 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:27:23,916 WARN L233 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:27:23,916 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2024-05-07 01:27:24,031 INFO L144 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2024-05-07 01:27:24,038 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:27:24,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:27:24,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:27:24,041 INFO L229 MonitoredProcess]: Starting monitored process 39 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-07 01:27:24,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (39)] Waiting until timeout for monitored process [2024-05-07 01:27:24,061 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:27:24,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:24,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:27:24,061 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:27:24,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:27:24,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:24,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 147210509, now seen corresponding path program 1 times [2024-05-07 01:27:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002663350] [2024-05-07 01:27:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6845 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 6480 trivial. 0 not checked. [2024-05-07 01:27:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:27:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002663350] [2024-05-07 01:27:24,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002663350] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:27:24,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:27:24,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:27:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86420222] [2024-05-07 01:27:24,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:27:24,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:27:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:27:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:27:24,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:27:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:24,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:27:24,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 377.5) internal successors, (755), 2 states have internal predecessors, (755), 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-07 01:27:24,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:24,961 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:27:24,961 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 1038 treesize of output 942 [2024-05-07 01:27:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 1 times [2024-05-07 01:27:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:25,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:25,124 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:27:25,125 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 1056 treesize of output 960 [2024-05-07 01:27:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1553555817, now seen corresponding path program 1 times [2024-05-07 01:27:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:25,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:27:25,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:27:25,635 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:25,635 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 1046 treesize of output 946 [2024-05-07 01:27:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 2 times [2024-05-07 01:27:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:25,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:25,836 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:27:25,836 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 514 treesize of output 462 [2024-05-07 01:27:25,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2100901031, now seen corresponding path program 1 times [2024-05-07 01:27:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:25,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:27:26,331 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:26,332 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 278 treesize of output 250 [2024-05-07 01:27:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 3 times [2024-05-07 01:27:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:26,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:26,962 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 259 treesize of output 235 [2024-05-07 01:27:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1685346023, now seen corresponding path program 1 times [2024-05-07 01:27:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:27:27,656 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:27:27,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 01:27:27,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1587689421, now seen corresponding path program 4 times [2024-05-07 01:27:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:27:27,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:27:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450,SelfDestructingSolverStorable451,SelfDestructingSolverStorable449,SelfDestructingSolverStorable456,SelfDestructingSolverStorable457,SelfDestructingSolverStorable458,SelfDestructingSolverStorable448,SelfDestructingSolverStorable459,SelfDestructingSolverStorable452,SelfDestructingSolverStorable453,SelfDestructingSolverStorable454,SelfDestructingSolverStorable455 [2024-05-07 01:27:37,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:37,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1767323298, now seen corresponding path program 1 times [2024-05-07 01:27:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124419798] [2024-05-07 01:27:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:37,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:39,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:27:39,079 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:27:39,079 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:27:39,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:27:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2024-05-07 01:27:39,080 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:27:39,080 WARN L233 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:27:39,080 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2024-05-07 01:27:39,217 INFO L144 ThreadInstanceAdder]: Constructed 38 joinOtherThreadTransitions. [2024-05-07 01:27:39,224 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:27:39,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:27:39,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:27:39,236 INFO L229 MonitoredProcess]: Starting monitored process 40 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-07 01:27:39,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (40)] Waiting until timeout for monitored process [2024-05-07 01:27:39,242 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:27:39,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:39,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:27:39,243 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:27:39,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:27:40,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:40,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1823690826, now seen corresponding path program 1 times [2024-05-07 01:27:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305137743] [2024-05-07 01:27:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:40,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7220 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 6845 trivial. 0 not checked. [2024-05-07 01:27:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:27:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305137743] [2024-05-07 01:27:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305137743] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:27:40,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:27:40,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:27:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012959180] [2024-05-07 01:27:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:27:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:27:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:27:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:27:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:27:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:40,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:27:40,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 387.0) internal successors, (774), 2 states have internal predecessors, (774), 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-07 01:27:40,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:40,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 542 treesize of output 494 [2024-05-07 01:27:40,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 1 times [2024-05-07 01:27:40,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:40,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:41,155 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:27:41,156 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 550 treesize of output 502 [2024-05-07 01:27:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1858525477, now seen corresponding path program 1 times [2024-05-07 01:27:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:41,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:41,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:27:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:27:41,850 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:41,851 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 576 treesize of output 524 [2024-05-07 01:27:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 2 times [2024-05-07 01:27:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:41,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:42,235 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:27:42,235 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 522 treesize of output 470 [2024-05-07 01:27:42,294 INFO L85 PathProgramCache]: Analyzing trace with hash 791449502, now seen corresponding path program 1 times [2024-05-07 01:27:42,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:42,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:27:43,122 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:27:43,122 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 270 treesize of output 242 [2024-05-07 01:27:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 3 times [2024-05-07 01:27:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:43,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:43,974 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 536 treesize of output 488 [2024-05-07 01:27:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2033463221, now seen corresponding path program 1 times [2024-05-07 01:27:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:44,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:27:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:27:44,899 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:27:44,900 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 550 treesize of output 498 [2024-05-07 01:27:44,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1686709370, now seen corresponding path program 4 times [2024-05-07 01:27:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:27:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:27:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:27:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:57,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470,SelfDestructingSolverStorable471,SelfDestructingSolverStorable461,SelfDestructingSolverStorable472,SelfDestructingSolverStorable462,SelfDestructingSolverStorable467,SelfDestructingSolverStorable468,SelfDestructingSolverStorable469,SelfDestructingSolverStorable463,SelfDestructingSolverStorable464,SelfDestructingSolverStorable465,SelfDestructingSolverStorable466 [2024-05-07 01:27:57,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:57,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash -451175715, now seen corresponding path program 1 times [2024-05-07 01:27:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527590702] [2024-05-07 01:27:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:57,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:57,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:27:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:27:58,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:27:58,829 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:27:58,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:27:58,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:27:58,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2024-05-07 01:27:58,830 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:27:58,830 WARN L233 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:27:58,830 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2024-05-07 01:27:58,948 INFO L144 ThreadInstanceAdder]: Constructed 39 joinOtherThreadTransitions. [2024-05-07 01:27:58,955 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:27:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:27:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:27:58,959 INFO L229 MonitoredProcess]: Starting monitored process 41 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-07 01:27:58,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (41)] Waiting until timeout for monitored process [2024-05-07 01:27:58,978 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:27:58,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:58,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:27:58,979 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:27:58,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:27:59,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:27:59,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:27:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 640255144, now seen corresponding path program 1 times [2024-05-07 01:27:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:27:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476683477] [2024-05-07 01:27:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:27:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:27:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:27:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7605 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 7220 trivial. 0 not checked. [2024-05-07 01:27:59,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:27:59,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476683477] [2024-05-07 01:27:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476683477] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:27:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:27:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:27:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835781514] [2024-05-07 01:27:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:27:59,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:27:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:27:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:27:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:27:59,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:59,917 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:27:59,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 396.5) internal successors, (793), 2 states have internal predecessors, (793), 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-07 01:27:59,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:27:59,983 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 506 treesize of output 458 [2024-05-07 01:28:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 1 times [2024-05-07 01:28:00,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:00,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:00,139 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:28:00,139 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 550 treesize of output 502 [2024-05-07 01:28:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1480756433, now seen corresponding path program 1 times [2024-05-07 01:28:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:00,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:00,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:28:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:28:00,495 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:28:00,496 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 296 treesize of output 268 [2024-05-07 01:28:00,533 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 2 times [2024-05-07 01:28:00,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:00,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:00,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:00,696 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:28:00,696 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 1046 treesize of output 946 [2024-05-07 01:28:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1620135601, now seen corresponding path program 1 times [2024-05-07 01:28:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:01,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:28:01,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:28:01,395 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:28:01,395 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 1064 treesize of output 964 [2024-05-07 01:28:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 3 times [2024-05-07 01:28:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:01,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:01,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:02,038 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 536 treesize of output 488 [2024-05-07 01:28:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 892280878, now seen corresponding path program 1 times [2024-05-07 01:28:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:28:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:28:02,726 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:28:02,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1064 treesize of output 964 [2024-05-07 01:28:02,791 INFO L85 PathProgramCache]: Analyzing trace with hash -652802701, now seen corresponding path program 4 times [2024-05-07 01:28:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:02,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:02,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:28:02,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:28:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:12,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481,SelfDestructingSolverStorable482,SelfDestructingSolverStorable483,SelfDestructingSolverStorable484,SelfDestructingSolverStorable480,SelfDestructingSolverStorable478,SelfDestructingSolverStorable479,SelfDestructingSolverStorable474,SelfDestructingSolverStorable485,SelfDestructingSolverStorable475,SelfDestructingSolverStorable476,SelfDestructingSolverStorable477 [2024-05-07 01:28:12,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:28:12,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1866994604, now seen corresponding path program 1 times [2024-05-07 01:28:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:28:12,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467320022] [2024-05-07 01:28:12,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:13,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:14,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:28:14,451 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:28:14,451 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:28:14,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:28:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2024-05-07 01:28:14,452 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:28:14,452 WARN L233 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:28:14,452 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2024-05-07 01:28:14,589 INFO L144 ThreadInstanceAdder]: Constructed 40 joinOtherThreadTransitions. [2024-05-07 01:28:14,595 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:28:14,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:28:14,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:28:14,596 INFO L229 MonitoredProcess]: Starting monitored process 42 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-07 01:28:14,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (42)] Waiting until timeout for monitored process [2024-05-07 01:28:14,619 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:28:14,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:14,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:28:14,620 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:28:14,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:28:15,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:28:15,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1030088935, now seen corresponding path program 1 times [2024-05-07 01:28:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:28:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789718310] [2024-05-07 01:28:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8000 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 7605 trivial. 0 not checked. [2024-05-07 01:28:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:28:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789718310] [2024-05-07 01:28:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789718310] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:28:16,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:28:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:28:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756608883] [2024-05-07 01:28:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:28:16,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:28:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:28:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:28:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:28:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:16,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:28:16,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 406.0) internal successors, (812), 2 states have internal predecessors, (812), 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-07 01:28:16,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:16,309 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 1030 treesize of output 934 [2024-05-07 01:28:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 1 times [2024-05-07 01:28:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:16,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:16,465 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 1030 treesize of output 934 [2024-05-07 01:28:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1856946641, now seen corresponding path program 1 times [2024-05-07 01:28:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:28:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:28:16,967 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:28:16,967 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 550 treesize of output 498 [2024-05-07 01:28:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 2 times [2024-05-07 01:28:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:17,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:17,170 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:28:17,170 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 270 treesize of output 242 [2024-05-07 01:28:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1560400209, now seen corresponding path program 1 times [2024-05-07 01:28:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:17,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:17,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:28:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:28:17,753 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:28:17,753 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 296 treesize of output 268 [2024-05-07 01:28:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 3 times [2024-05-07 01:28:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:17,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:18,553 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:28:18,554 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 511 treesize of output 489 [2024-05-07 01:28:18,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:28:18,567 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 71 treesize of output 69 [2024-05-07 01:28:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash -617462291, now seen corresponding path program 1 times [2024-05-07 01:28:18,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:18,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:19,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:28:19,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:28:19,240 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:28:19,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 01:28:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash -271102051, now seen corresponding path program 4 times [2024-05-07 01:28:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:19,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:19,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:28:19,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:28:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492,SelfDestructingSolverStorable493,SelfDestructingSolverStorable494,SelfDestructingSolverStorable495,SelfDestructingSolverStorable490,SelfDestructingSolverStorable491,SelfDestructingSolverStorable489,SelfDestructingSolverStorable496,SelfDestructingSolverStorable497,SelfDestructingSolverStorable487,SelfDestructingSolverStorable498,SelfDestructingSolverStorable488 [2024-05-07 01:28:34,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:28:34,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -106864867, now seen corresponding path program 1 times [2024-05-07 01:28:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:28:34,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450624285] [2024-05-07 01:28:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:34,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:36,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:28:36,419 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:28:36,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:28:36,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:28:36,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2024-05-07 01:28:36,420 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:28:36,420 WARN L233 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:28:36,420 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2024-05-07 01:28:36,547 INFO L144 ThreadInstanceAdder]: Constructed 41 joinOtherThreadTransitions. [2024-05-07 01:28:36,555 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:28:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:28:36,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:28:36,558 INFO L229 MonitoredProcess]: Starting monitored process 43 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-07 01:28:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (43)] Waiting until timeout for monitored process [2024-05-07 01:28:36,579 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:28:36,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:36,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:28:36,580 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:28:36,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:28:37,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:28:37,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:37,855 INFO L85 PathProgramCache]: Analyzing trace with hash 628066759, now seen corresponding path program 1 times [2024-05-07 01:28:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:28:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662240616] [2024-05-07 01:28:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8405 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 8000 trivial. 0 not checked. [2024-05-07 01:28:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:28:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662240616] [2024-05-07 01:28:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662240616] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:28:38,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:28:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:28:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860186935] [2024-05-07 01:28:38,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:28:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:28:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:28:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:28:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:28:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:38,240 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:28:38,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 415.5) internal successors, (831), 2 states have internal predecessors, (831), 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-07 01:28:38,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:38,298 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 1030 treesize of output 934 [2024-05-07 01:28:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 1 times [2024-05-07 01:28:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:38,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:38,505 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:28:38,505 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 514 treesize of output 466 [2024-05-07 01:28:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash -454735617, now seen corresponding path program 1 times [2024-05-07 01:28:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:28:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:28:38,950 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:28:38,950 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 1038 treesize of output 938 [2024-05-07 01:28:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 2 times [2024-05-07 01:28:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:39,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:39,151 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:28:39,151 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 1046 treesize of output 946 [2024-05-07 01:28:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -854717943, now seen corresponding path program 1 times [2024-05-07 01:28:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:28:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:28:39,725 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:28:39,725 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 550 treesize of output 498 [2024-05-07 01:28:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 3 times [2024-05-07 01:28:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:39,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:40,450 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 536 treesize of output 488 [2024-05-07 01:28:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1082488758, now seen corresponding path program 1 times [2024-05-07 01:28:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:40,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:40,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:28:40,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:28:41,118 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:28:41,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 296 treesize of output 268 [2024-05-07 01:28:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2123161565, now seen corresponding path program 4 times [2024-05-07 01:28:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:41,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:28:41,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:28:55,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:55,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508,SelfDestructingSolverStorable509,SelfDestructingSolverStorable504,SelfDestructingSolverStorable505,SelfDestructingSolverStorable506,SelfDestructingSolverStorable507,SelfDestructingSolverStorable500,SelfDestructingSolverStorable511,SelfDestructingSolverStorable501,SelfDestructingSolverStorable502,SelfDestructingSolverStorable503,SelfDestructingSolverStorable510 [2024-05-07 01:28:55,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:28:55,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1697178761, now seen corresponding path program 1 times [2024-05-07 01:28:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:28:55,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157178663] [2024-05-07 01:28:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:55,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:57,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:28:57,068 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:28:57,068 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:28:57,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:28:57,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2024-05-07 01:28:57,068 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:28:57,069 WARN L233 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:28:57,069 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2024-05-07 01:28:57,202 INFO L144 ThreadInstanceAdder]: Constructed 42 joinOtherThreadTransitions. [2024-05-07 01:28:57,209 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:28:57,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:28:57,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:28:57,212 INFO L229 MonitoredProcess]: Starting monitored process 44 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-07 01:28:57,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (44)] Waiting until timeout for monitored process [2024-05-07 01:28:57,233 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:28:57,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:57,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:28:57,233 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:28:57,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:28:58,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:28:58,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:28:58,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1182224632, now seen corresponding path program 1 times [2024-05-07 01:28:58,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:28:58,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163902750] [2024-05-07 01:28:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8820 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 8405 trivial. 0 not checked. [2024-05-07 01:28:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:28:58,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163902750] [2024-05-07 01:28:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163902750] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:28:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:28:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:28:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269343347] [2024-05-07 01:28:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:28:58,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:28:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:28:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:28:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:28:58,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:58,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:28:58,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 425.0) internal successors, (850), 2 states have internal predecessors, (850), 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-07 01:28:58,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:28:58,687 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:28:58,688 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 1038 treesize of output 942 [2024-05-07 01:28:58,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 1 times [2024-05-07 01:28:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:58,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:58,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:59,044 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:28:59,044 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 568 treesize of output 520 [2024-05-07 01:28:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1286176611, now seen corresponding path program 1 times [2024-05-07 01:28:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:28:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:28:59,390 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:28:59,391 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 522 treesize of output 470 [2024-05-07 01:28:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 2 times [2024-05-07 01:28:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:59,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:28:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:28:59,602 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:28:59,602 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 270 treesize of output 242 [2024-05-07 01:28:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1237667854, now seen corresponding path program 1 times [2024-05-07 01:28:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:59,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:28:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:28:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:28:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:28:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:00,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:29:00,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:29:00,447 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:00,448 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 522 treesize of output 470 [2024-05-07 01:29:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 3 times [2024-05-07 01:29:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:00,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:01,482 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 1018 treesize of output 922 [2024-05-07 01:29:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash -618224910, now seen corresponding path program 1 times [2024-05-07 01:29:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:29:02,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:29:02,450 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:29:02,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 01:29:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1910963062, now seen corresponding path program 4 times [2024-05-07 01:29:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:02,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:02,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:29:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:29:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:29:18,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519,SelfDestructingSolverStorable515,SelfDestructingSolverStorable516,SelfDestructingSolverStorable517,SelfDestructingSolverStorable518,SelfDestructingSolverStorable522,SelfDestructingSolverStorable523,SelfDestructingSolverStorable513,SelfDestructingSolverStorable524,SelfDestructingSolverStorable514,SelfDestructingSolverStorable520,SelfDestructingSolverStorable521 [2024-05-07 01:29:18,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:29:18,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:29:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash 323411040, now seen corresponding path program 1 times [2024-05-07 01:29:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:29:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588447428] [2024-05-07 01:29:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:19,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:20,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:29:20,785 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:29:20,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:29:20,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:29:20,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2024-05-07 01:29:20,785 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:29:20,786 WARN L233 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:29:20,786 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2024-05-07 01:29:20,931 INFO L144 ThreadInstanceAdder]: Constructed 43 joinOtherThreadTransitions. [2024-05-07 01:29:20,937 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:29:20,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:29:20,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:29:20,940 INFO L229 MonitoredProcess]: Starting monitored process 45 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-07 01:29:20,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (45)] Waiting until timeout for monitored process [2024-05-07 01:29:20,963 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:29:20,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:29:20,964 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:29:20,964 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:29:20,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:29:21,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:29:21,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:29:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1609041046, now seen corresponding path program 1 times [2024-05-07 01:29:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:29:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47470853] [2024-05-07 01:29:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9245 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 8820 trivial. 0 not checked. [2024-05-07 01:29:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:29:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47470853] [2024-05-07 01:29:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47470853] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:29:22,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:29:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:29:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76582093] [2024-05-07 01:29:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:29:22,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:29:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:29:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:29:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:29:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:29:22,164 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:29:22,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 434.5) internal successors, (869), 2 states have internal predecessors, (869), 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-07 01:29:22,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:29:22,240 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:29:22,240 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 550 treesize of output 502 [2024-05-07 01:29:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 1 times [2024-05-07 01:29:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:22,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:22,459 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:29:22,460 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 270 treesize of output 246 [2024-05-07 01:29:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2080328414, now seen corresponding path program 1 times [2024-05-07 01:29:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:22,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:29:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:29:23,029 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:23,030 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 1046 treesize of output 946 [2024-05-07 01:29:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 2 times [2024-05-07 01:29:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:23,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:23,243 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:23,244 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 558 treesize of output 506 [2024-05-07 01:29:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1661468115, now seen corresponding path program 1 times [2024-05-07 01:29:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:23,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:29:23,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:29:23,754 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:23,754 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 278 treesize of output 250 [2024-05-07 01:29:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 3 times [2024-05-07 01:29:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:23,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:25,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:29:25,125 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 547 treesize of output 525 [2024-05-07 01:29:25,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-05-07 01:29:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1100278383, now seen corresponding path program 1 times [2024-05-07 01:29:25,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:25,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:29:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:29:25,832 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:29:25,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1046 treesize of output 946 [2024-05-07 01:29:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1753248042, now seen corresponding path program 4 times [2024-05-07 01:29:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:29:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:29:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:29:40,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526,SelfDestructingSolverStorable537,SelfDestructingSolverStorable527,SelfDestructingSolverStorable528,SelfDestructingSolverStorable529,SelfDestructingSolverStorable533,SelfDestructingSolverStorable534,SelfDestructingSolverStorable535,SelfDestructingSolverStorable536,SelfDestructingSolverStorable530,SelfDestructingSolverStorable531,SelfDestructingSolverStorable532 [2024-05-07 01:29:40,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:29:40,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:29:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1834117431, now seen corresponding path program 1 times [2024-05-07 01:29:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:29:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171590279] [2024-05-07 01:29:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:40,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:42,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:29:42,013 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:29:42,013 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:29:42,013 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:29:42,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2024-05-07 01:29:42,014 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:29:42,014 WARN L233 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:29:42,014 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2024-05-07 01:29:42,364 INFO L144 ThreadInstanceAdder]: Constructed 44 joinOtherThreadTransitions. [2024-05-07 01:29:42,370 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:29:42,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:29:42,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:29:42,372 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-07 01:29:42,374 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-07 01:29:42,394 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:29:42,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:29:42,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:29:42,394 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:29:42,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:29:43,516 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:29:43,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:29:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash -623561043, now seen corresponding path program 1 times [2024-05-07 01:29:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:29:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486333593] [2024-05-07 01:29:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9680 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 9245 trivial. 0 not checked. [2024-05-07 01:29:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:29:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486333593] [2024-05-07 01:29:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486333593] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:29:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:29:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:29:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921016716] [2024-05-07 01:29:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:29:44,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:29:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:29:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:29:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:29:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:29:44,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:29:44,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 444.0) internal successors, (888), 2 states have internal predecessors, (888), 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-07 01:29:44,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:29:44,484 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:29:44,485 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 550 treesize of output 502 [2024-05-07 01:29:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 1 times [2024-05-07 01:29:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:44,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:44,661 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 1030 treesize of output 934 [2024-05-07 01:29:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash -182865010, now seen corresponding path program 1 times [2024-05-07 01:29:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:29:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:29:45,029 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:45,030 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 1046 treesize of output 946 [2024-05-07 01:29:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 2 times [2024-05-07 01:29:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:45,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:45,263 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:45,263 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 296 treesize of output 268 [2024-05-07 01:29:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 261951848, now seen corresponding path program 1 times [2024-05-07 01:29:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:45,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:29:45,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:29:46,021 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:29:46,021 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 522 treesize of output 470 [2024-05-07 01:29:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 3 times [2024-05-07 01:29:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:46,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:29:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:29:46,889 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:29:46,889 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 270 treesize of output 260 [2024-05-07 01:29:46,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:29:46,903 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 62 treesize of output 62 [2024-05-07 01:29:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1254415831, now seen corresponding path program 1 times [2024-05-07 01:29:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:47,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:29:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:29:47,567 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:29:47,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 01:29:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 702810781, now seen corresponding path program 4 times [2024-05-07 01:29:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:47,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:29:47,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:29:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:29:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:29:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:29:47,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:30:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:04,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550,SelfDestructingSolverStorable548,SelfDestructingSolverStorable549,SelfDestructingSolverStorable539,SelfDestructingSolverStorable544,SelfDestructingSolverStorable545,SelfDestructingSolverStorable546,SelfDestructingSolverStorable547,SelfDestructingSolverStorable540,SelfDestructingSolverStorable541,SelfDestructingSolverStorable542,SelfDestructingSolverStorable543 [2024-05-07 01:30:04,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:30:04,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1278800951, now seen corresponding path program 1 times [2024-05-07 01:30:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:30:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490186197] [2024-05-07 01:30:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:05,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:07,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:30:07,188 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:30:07,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:30:07,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:30:07,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2024-05-07 01:30:07,189 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:30:07,189 WARN L233 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:30:07,189 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2024-05-07 01:30:07,335 INFO L144 ThreadInstanceAdder]: Constructed 45 joinOtherThreadTransitions. [2024-05-07 01:30:07,345 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:30:07,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:30:07,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:30:07,399 INFO L229 MonitoredProcess]: Starting monitored process 47 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-07 01:30:07,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (47)] Waiting until timeout for monitored process [2024-05-07 01:30:07,420 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:30:07,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:07,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:30:07,421 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:30:07,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:30:08,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:30:08,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1454894191, now seen corresponding path program 1 times [2024-05-07 01:30:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:30:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010456788] [2024-05-07 01:30:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10125 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 9680 trivial. 0 not checked. [2024-05-07 01:30:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:30:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010456788] [2024-05-07 01:30:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010456788] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:30:09,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:30:09,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:30:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154633581] [2024-05-07 01:30:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:30:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:30:09,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:30:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:30:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:30:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:09,255 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:30:09,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 453.5) internal successors, (907), 2 states have internal predecessors, (907), 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-07 01:30:09,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:09,321 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:30:09,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 1038 treesize of output 942 [2024-05-07 01:30:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 1 times [2024-05-07 01:30:09,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:09,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:09,514 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:30:09,514 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 270 treesize of output 246 [2024-05-07 01:30:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -119995717, now seen corresponding path program 1 times [2024-05-07 01:30:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:30:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:30:10,034 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:30:10,034 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 522 treesize of output 470 [2024-05-07 01:30:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 2 times [2024-05-07 01:30:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:10,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:10,259 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:30:10,260 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 296 treesize of output 268 [2024-05-07 01:30:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash 28480799, now seen corresponding path program 1 times [2024-05-07 01:30:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:30:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:30:10,954 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:30:10,954 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 1046 treesize of output 946 [2024-05-07 01:30:11,002 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 3 times [2024-05-07 01:30:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:11,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:11,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:11,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:30:11,687 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 511 treesize of output 489 [2024-05-07 01:30:11,704 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:30:11,704 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 71 treesize of output 69 [2024-05-07 01:30:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1165129275, now seen corresponding path program 1 times [2024-05-07 01:30:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:12,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:30:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:30:12,423 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:30:12,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 522 treesize of output 470 [2024-05-07 01:30:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash -36536299, now seen corresponding path program 4 times [2024-05-07 01:30:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:12,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:12,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:30:12,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:30:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:30,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560,SelfDestructingSolverStorable561,SelfDestructingSolverStorable559,SelfDestructingSolverStorable555,SelfDestructingSolverStorable556,SelfDestructingSolverStorable557,SelfDestructingSolverStorable558,SelfDestructingSolverStorable562,SelfDestructingSolverStorable552,SelfDestructingSolverStorable563,SelfDestructingSolverStorable553,SelfDestructingSolverStorable554 [2024-05-07 01:30:30,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:30:30,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:30,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1938813795, now seen corresponding path program 1 times [2024-05-07 01:30:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:30:30,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659447011] [2024-05-07 01:30:30,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:31,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:33,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:30:33,252 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:30:33,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:30:33,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:30:33,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2024-05-07 01:30:33,253 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:30:33,253 WARN L233 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:30:33,253 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2024-05-07 01:30:33,400 INFO L144 ThreadInstanceAdder]: Constructed 46 joinOtherThreadTransitions. [2024-05-07 01:30:33,406 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:30:33,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:30:33,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:30:33,408 INFO L229 MonitoredProcess]: Starting monitored process 48 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-07 01:30:33,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (48)] Waiting until timeout for monitored process [2024-05-07 01:30:33,430 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:30:33,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:33,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:30:33,430 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:30:33,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:30:34,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:30:34,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -188066090, now seen corresponding path program 1 times [2024-05-07 01:30:34,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:30:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276945814] [2024-05-07 01:30:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10580 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 10125 trivial. 0 not checked. [2024-05-07 01:30:35,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:30:35,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276945814] [2024-05-07 01:30:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276945814] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:30:35,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:30:35,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:30:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546821497] [2024-05-07 01:30:35,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:30:35,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:30:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:30:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:30:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:30:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:35,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:30:35,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 463.0) internal successors, (926), 2 states have internal predecessors, (926), 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-07 01:30:35,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:35,358 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 1030 treesize of output 934 [2024-05-07 01:30:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 1 times [2024-05-07 01:30:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:35,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:35,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:35,548 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:30:35,548 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 568 treesize of output 520 [2024-05-07 01:30:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 542211729, now seen corresponding path program 1 times [2024-05-07 01:30:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:35,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:30:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:30:36,046 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:30:36,047 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 576 treesize of output 524 [2024-05-07 01:30:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 2 times [2024-05-07 01:30:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:36,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:36,266 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:30:36,266 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 576 treesize of output 524 [2024-05-07 01:30:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1544295493, now seen corresponding path program 1 times [2024-05-07 01:30:36,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:30:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:30:36,915 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:30:36,915 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 550 treesize of output 498 [2024-05-07 01:30:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 3 times [2024-05-07 01:30:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:37,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:37,576 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:30:37,576 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 511 treesize of output 489 [2024-05-07 01:30:37,591 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:30:37,591 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 71 treesize of output 69 [2024-05-07 01:30:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1335849103, now seen corresponding path program 1 times [2024-05-07 01:30:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:38,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:30:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:30:38,295 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:30:38,295 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 550 treesize of output 498 [2024-05-07 01:30:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash -669908215, now seen corresponding path program 4 times [2024-05-07 01:30:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:38,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:30:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:30:38,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:30:38,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:30:57,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:30:57,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570,SelfDestructingSolverStorable571,SelfDestructingSolverStorable572,SelfDestructingSolverStorable566,SelfDestructingSolverStorable567,SelfDestructingSolverStorable568,SelfDestructingSolverStorable569,SelfDestructingSolverStorable573,SelfDestructingSolverStorable574,SelfDestructingSolverStorable575,SelfDestructingSolverStorable565,SelfDestructingSolverStorable576 [2024-05-07 01:30:57,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:30:57,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:30:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 882511359, now seen corresponding path program 1 times [2024-05-07 01:30:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:30:57,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229220990] [2024-05-07 01:30:57,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:30:57,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:30:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:30:58,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:30:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:00,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:31:00,245 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:31:00,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:31:00,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:31:00,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2024-05-07 01:31:00,246 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:31:00,246 WARN L233 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:31:00,246 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2024-05-07 01:31:00,418 INFO L144 ThreadInstanceAdder]: Constructed 47 joinOtherThreadTransitions. [2024-05-07 01:31:00,427 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:31:00,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:31:00,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:31:00,436 INFO L229 MonitoredProcess]: Starting monitored process 49 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-07 01:31:00,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (49)] Waiting until timeout for monitored process [2024-05-07 01:31:00,455 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:31:00,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:31:00,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:31:00,456 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:31:00,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:31:02,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:31:02,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:31:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 384357948, now seen corresponding path program 1 times [2024-05-07 01:31:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:31:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385380423] [2024-05-07 01:31:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11045 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 10580 trivial. 0 not checked. [2024-05-07 01:31:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:31:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385380423] [2024-05-07 01:31:02,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385380423] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:31:02,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:31:02,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:31:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068750274] [2024-05-07 01:31:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:31:02,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:31:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:31:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:31:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:31:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:31:02,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:31:02,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 472.5) internal successors, (945), 2 states have internal predecessors, (945), 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-07 01:31:02,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:31:02,664 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:31:02,664 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 568 treesize of output 520 [2024-05-07 01:31:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 1 times [2024-05-07 01:31:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:02,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:02,958 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:31:02,959 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 270 treesize of output 246 [2024-05-07 01:31:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1151678908, now seen corresponding path program 1 times [2024-05-07 01:31:02,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:02,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:31:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:31:03,472 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:31:03,472 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 514 treesize of output 462 [2024-05-07 01:31:03,518 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 2 times [2024-05-07 01:31:03,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:03,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:03,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:03,698 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:31:03,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 514 treesize of output 462 [2024-05-07 01:31:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1911254796, now seen corresponding path program 1 times [2024-05-07 01:31:03,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:04,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:31:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:31:04,418 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:31:04,418 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 270 treesize of output 242 [2024-05-07 01:31:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 3 times [2024-05-07 01:31:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:04,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:05,152 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:31:05,152 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 511 treesize of output 489 [2024-05-07 01:31:05,164 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:31:05,164 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 71 treesize of output 69 [2024-05-07 01:31:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1979587254, now seen corresponding path program 1 times [2024-05-07 01:31:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:31:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:31:05,894 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:31:05,894 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 1038 treesize of output 938 [2024-05-07 01:31:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -117943091, now seen corresponding path program 4 times [2024-05-07 01:31:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:31:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:31:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:31:28,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580,SelfDestructingSolverStorable581,SelfDestructingSolverStorable582,SelfDestructingSolverStorable583,SelfDestructingSolverStorable588,SelfDestructingSolverStorable578,SelfDestructingSolverStorable589,SelfDestructingSolverStorable579,SelfDestructingSolverStorable584,SelfDestructingSolverStorable585,SelfDestructingSolverStorable586,SelfDestructingSolverStorable587 [2024-05-07 01:31:28,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:31:28,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:31:28,667 INFO L85 PathProgramCache]: Analyzing trace with hash -543012576, now seen corresponding path program 1 times [2024-05-07 01:31:28,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:31:28,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550580823] [2024-05-07 01:31:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:29,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:31,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:31:31,384 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:31:31,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:31:31,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:31:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2024-05-07 01:31:31,385 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:31:31,385 WARN L233 ceAbstractionStarter]: 47 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:31:31,385 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 48 thread instances. [2024-05-07 01:31:31,535 INFO L144 ThreadInstanceAdder]: Constructed 48 joinOtherThreadTransitions. [2024-05-07 01:31:31,542 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:31:31,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:31:31,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:31:31,544 INFO L229 MonitoredProcess]: Starting monitored process 50 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-07 01:31:31,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (50)] Waiting until timeout for monitored process [2024-05-07 01:31:31,564 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:31:31,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:31:31,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:31:31,564 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:31:31,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:31:33,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:31:33,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:31:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash -174884221, now seen corresponding path program 1 times [2024-05-07 01:31:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:31:33,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091766642] [2024-05-07 01:31:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11520 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 11045 trivial. 0 not checked. [2024-05-07 01:31:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:31:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091766642] [2024-05-07 01:31:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091766642] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:31:33,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:31:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:31:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118230021] [2024-05-07 01:31:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:31:33,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:31:33,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:31:33,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:31:33,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:31:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:31:33,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:31:33,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 482.0) internal successors, (964), 2 states have internal predecessors, (964), 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-07 01:31:33,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:31:33,681 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:31:33,681 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 568 treesize of output 520 [2024-05-07 01:31:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 1 times [2024-05-07 01:31:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:33,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:33,864 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:31:33,864 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 568 treesize of output 520 [2024-05-07 01:31:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash -60780354, now seen corresponding path program 1 times [2024-05-07 01:31:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:33,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:34,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:31:34,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:31:34,417 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:31:34,417 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 296 treesize of output 268 [2024-05-07 01:31:34,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 2 times [2024-05-07 01:31:34,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:34,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:34,636 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:31:34,636 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 514 treesize of output 462 [2024-05-07 01:31:34,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1537588450, now seen corresponding path program 1 times [2024-05-07 01:31:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:34,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:31:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:31:35,380 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:31:35,381 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 1038 treesize of output 938 [2024-05-07 01:31:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 3 times [2024-05-07 01:31:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:35,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:31:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:31:36,424 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 1018 treesize of output 922 [2024-05-07 01:31:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1310138098, now seen corresponding path program 1 times [2024-05-07 01:31:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:36,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:31:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:31:37,078 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:31:37,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 540 treesize of output 488 [2024-05-07 01:31:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1743064569, now seen corresponding path program 4 times [2024-05-07 01:31:37,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:37,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:37,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:31:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:31:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:31:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:31:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:31:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:32:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:32:01,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591,SelfDestructingSolverStorable592,SelfDestructingSolverStorable593,SelfDestructingSolverStorable594,SelfDestructingSolverStorable599,SelfDestructingSolverStorable600,SelfDestructingSolverStorable601,SelfDestructingSolverStorable602,SelfDestructingSolverStorable595,SelfDestructingSolverStorable596,SelfDestructingSolverStorable597,SelfDestructingSolverStorable598 [2024-05-07 01:32:01,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:32:01,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:32:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash -452002736, now seen corresponding path program 1 times [2024-05-07 01:32:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:32:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029699305] [2024-05-07 01:32:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:01,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:03,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:32:03,987 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:32:03,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:32:03,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:32:03,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2024-05-07 01:32:03,988 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:32:03,988 WARN L233 ceAbstractionStarter]: 48 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:32:03,988 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 49 thread instances. [2024-05-07 01:32:04,144 INFO L144 ThreadInstanceAdder]: Constructed 49 joinOtherThreadTransitions. [2024-05-07 01:32:04,153 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:32:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:32:04,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:32:04,156 INFO L229 MonitoredProcess]: Starting monitored process 51 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-07 01:32:04,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (51)] Waiting until timeout for monitored process [2024-05-07 01:32:04,178 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:32:04,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:32:04,179 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:32:04,179 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:32:04,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:32:06,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:32:06,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:32:06,026 INFO L85 PathProgramCache]: Analyzing trace with hash -205816981, now seen corresponding path program 1 times [2024-05-07 01:32:06,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:32:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643614326] [2024-05-07 01:32:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:06,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12005 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 11520 trivial. 0 not checked. [2024-05-07 01:32:06,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:32:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643614326] [2024-05-07 01:32:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643614326] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:32:06,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:32:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:32:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431653706] [2024-05-07 01:32:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:32:06,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:32:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:32:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:32:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:32:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:32:06,458 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:32:06,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 491.5) internal successors, (983), 2 states have internal predecessors, (983), 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-07 01:32:06,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:32:06,531 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:32:06,531 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 270 treesize of output 246 [2024-05-07 01:32:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 1 times [2024-05-07 01:32:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:06,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:06,753 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 262 treesize of output 238 [2024-05-07 01:32:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1736445115, now seen corresponding path program 1 times [2024-05-07 01:32:06,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:06,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:06,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:07,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:32:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:32:07,163 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:32:07,163 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 1046 treesize of output 946 [2024-05-07 01:32:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 2 times [2024-05-07 01:32:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:07,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:07,546 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:32:07,546 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 1064 treesize of output 964 [2024-05-07 01:32:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1624476401, now seen corresponding path program 1 times [2024-05-07 01:32:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:32:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:32:08,243 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:32:08,243 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 278 treesize of output 250 [2024-05-07 01:32:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 3 times [2024-05-07 01:32:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:08,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:09,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:32:09,067 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 270 treesize of output 260 [2024-05-07 01:32:09,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-05-07 01:32:09,076 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 62 treesize of output 62 [2024-05-07 01:32:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1161697005, now seen corresponding path program 1 times [2024-05-07 01:32:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:09,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:32:09,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:32:09,892 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:32:09,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 250 [2024-05-07 01:32:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 39150861, now seen corresponding path program 4 times [2024-05-07 01:32:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:09,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:10,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:32:10,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:32:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:32:34,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607,SelfDestructingSolverStorable608,SelfDestructingSolverStorable609,SelfDestructingSolverStorable614,SelfDestructingSolverStorable604,SelfDestructingSolverStorable615,SelfDestructingSolverStorable605,SelfDestructingSolverStorable606,SelfDestructingSolverStorable610,SelfDestructingSolverStorable611,SelfDestructingSolverStorable612,SelfDestructingSolverStorable613 [2024-05-07 01:32:34,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:32:34,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:32:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 99834546, now seen corresponding path program 1 times [2024-05-07 01:32:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:32:34,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132883117] [2024-05-07 01:32:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:34,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:37,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:32:37,371 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:32:37,371 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:32:37,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:32:37,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2024-05-07 01:32:37,372 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:32:37,372 WARN L233 ceAbstractionStarter]: 49 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:32:37,372 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 50 thread instances. [2024-05-07 01:32:37,528 INFO L144 ThreadInstanceAdder]: Constructed 50 joinOtherThreadTransitions. [2024-05-07 01:32:37,536 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:32:37,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:32:37,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:32:37,538 INFO L229 MonitoredProcess]: Starting monitored process 52 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-07 01:32:37,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (52)] Waiting until timeout for monitored process [2024-05-07 01:32:37,561 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:32:37,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:32:37,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:32:37,561 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:32:37,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:32:39,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:32:39,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:32:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1072930124, now seen corresponding path program 1 times [2024-05-07 01:32:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:32:39,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39826079] [2024-05-07 01:32:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12500 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 12005 trivial. 0 not checked. [2024-05-07 01:32:39,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:32:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39826079] [2024-05-07 01:32:39,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39826079] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:32:39,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:32:39,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:32:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980445822] [2024-05-07 01:32:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:32:39,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:32:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:32:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:32:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:32:39,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:32:39,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:32:39,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 501.0) internal successors, (1002), 2 states have internal predecessors, (1002), 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-07 01:32:39,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:32:39,849 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 542 treesize of output 494 [2024-05-07 01:32:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 1 times [2024-05-07 01:32:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:40,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:40,193 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:32:40,193 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 1038 treesize of output 942 [2024-05-07 01:32:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1765775622, now seen corresponding path program 1 times [2024-05-07 01:32:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:40,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:40,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:32:40,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:32:40,714 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:32:40,714 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 296 treesize of output 268 [2024-05-07 01:32:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 2 times [2024-05-07 01:32:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:40,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:41,070 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:32:41,071 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 576 treesize of output 524 [2024-05-07 01:32:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1941771195, now seen corresponding path program 1 times [2024-05-07 01:32:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:32:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:32:41,771 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:32:41,771 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 296 treesize of output 268 [2024-05-07 01:32:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 3 times [2024-05-07 01:32:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:41,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:32:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:32:42,481 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 259 treesize of output 235 [2024-05-07 01:32:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2034771204, now seen corresponding path program 1 times [2024-05-07 01:32:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:32:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:32:43,283 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:32:43,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 576 treesize of output 524 [2024-05-07 01:32:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1808951092, now seen corresponding path program 4 times [2024-05-07 01:32:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:43,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:32:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:32:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:32:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:32:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:32:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:33:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:33:09,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618,SelfDestructingSolverStorable619,SelfDestructingSolverStorable625,SelfDestructingSolverStorable626,SelfDestructingSolverStorable627,SelfDestructingSolverStorable617,SelfDestructingSolverStorable628,SelfDestructingSolverStorable621,SelfDestructingSolverStorable622,SelfDestructingSolverStorable623,SelfDestructingSolverStorable624,SelfDestructingSolverStorable620 [2024-05-07 01:33:09,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:33:09,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:33:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash -797473463, now seen corresponding path program 1 times [2024-05-07 01:33:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:33:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871059359] [2024-05-07 01:33:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:10,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:13,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:33:13,100 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:33:13,100 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:33:13,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:33:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2024-05-07 01:33:13,100 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:33:13,101 WARN L233 ceAbstractionStarter]: 50 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:33:13,101 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 51 thread instances. [2024-05-07 01:33:13,386 INFO L144 ThreadInstanceAdder]: Constructed 51 joinOtherThreadTransitions. [2024-05-07 01:33:13,395 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:33:13,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:33:13,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:33:13,400 INFO L229 MonitoredProcess]: Starting monitored process 53 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-07 01:33:13,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (53)] Waiting until timeout for monitored process [2024-05-07 01:33:13,420 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:33:13,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:33:13,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:33:13,421 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:33:13,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:33:14,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:33:14,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:33:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1259572706, now seen corresponding path program 1 times [2024-05-07 01:33:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:33:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853478729] [2024-05-07 01:33:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13005 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 12500 trivial. 0 not checked. [2024-05-07 01:33:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:33:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853478729] [2024-05-07 01:33:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853478729] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:33:15,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:33:15,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:33:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134978353] [2024-05-07 01:33:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:33:15,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:33:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:33:15,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:33:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:33:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:33:15,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:33:15,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 510.5) internal successors, (1021), 2 states have internal predecessors, (1021), 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-07 01:33:15,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:33:15,312 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:33:15,312 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 568 treesize of output 520 [2024-05-07 01:33:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 1 times [2024-05-07 01:33:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:15,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:15,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:15,681 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:33:15,681 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 550 treesize of output 502 [2024-05-07 01:33:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1495987074, now seen corresponding path program 1 times [2024-05-07 01:33:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:16,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:33:16,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:33:16,339 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:33:16,340 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 540 treesize of output 488 [2024-05-07 01:33:16,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 2 times [2024-05-07 01:33:16,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:16,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:16,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:16,690 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:33:16,690 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 558 treesize of output 506 [2024-05-07 01:33:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash 293779767, now seen corresponding path program 1 times [2024-05-07 01:33:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:33:17,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:33:17,830 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:33:17,830 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 1038 treesize of output 938 [2024-05-07 01:33:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 3 times [2024-05-07 01:33:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:18,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:18,960 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 1018 treesize of output 922 [2024-05-07 01:33:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2020117263, now seen corresponding path program 1 times [2024-05-07 01:33:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:19,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:19,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:33:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-05-07 01:33:20,021 INFO L349 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2024-05-07 01:33:20,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 540 treesize of output 488 [2024-05-07 01:33:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1055640312, now seen corresponding path program 4 times [2024-05-07 01:33:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:20,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-07 01:33:20,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2024-05-07 01:33:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:33:44,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636,SelfDestructingSolverStorable637,SelfDestructingSolverStorable638,SelfDestructingSolverStorable639,SelfDestructingSolverStorable632,SelfDestructingSolverStorable633,SelfDestructingSolverStorable634,SelfDestructingSolverStorable635,SelfDestructingSolverStorable640,SelfDestructingSolverStorable630,SelfDestructingSolverStorable641,SelfDestructingSolverStorable631 [2024-05-07 01:33:44,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:33:44,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:33:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1758872406, now seen corresponding path program 1 times [2024-05-07 01:33:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:33:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579403451] [2024-05-07 01:33:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:45,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:48,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-07 01:33:48,207 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-07 01:33:48,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-05-07 01:33:48,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-05-07 01:33:48,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2024-05-07 01:33:48,208 INFO L448 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-05-07 01:33:48,208 WARN L233 ceAbstractionStarter]: 51 thread instances were not sufficient, I will increase this number and restart the analysis [2024-05-07 01:33:48,208 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 52 thread instances. [2024-05-07 01:33:48,377 INFO L144 ThreadInstanceAdder]: Constructed 52 joinOtherThreadTransitions. [2024-05-07 01:33:48,384 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-07 01:33:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-07 01:33:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-07 01:33:48,386 INFO L229 MonitoredProcess]: Starting monitored process 54 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-07 01:33:48,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (54)] Waiting until timeout for monitored process [2024-05-07 01:33:48,409 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-07 01:33:48,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:33:48,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-07 01:33:48,410 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;@2ad66d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-07 01:33:48,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-05-07 01:33:49,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-05-07 01:33:49,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-07 01:33:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash -587040919, now seen corresponding path program 1 times [2024-05-07 01:33:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-07 01:33:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526198588] [2024-05-07 01:33:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13520 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 13005 trivial. 0 not checked. [2024-05-07 01:33:49,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-07 01:33:49,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526198588] [2024-05-07 01:33:49,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526198588] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-07 01:33:49,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-07 01:33:49,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-07 01:33:49,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083683300] [2024-05-07 01:33:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-07 01:33:49,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-07 01:33:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-07 01:33:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-07 01:33:49,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-07 01:33:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:33:49,744 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-07 01:33:49,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 520.0) internal successors, (1040), 2 states have internal predecessors, (1040), 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-07 01:33:49,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-07 01:33:49,812 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:33:49,813 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 532 treesize of output 484 [2024-05-07 01:33:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 1 times [2024-05-07 01:33:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:49,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:50,045 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-05-07 01:33:50,045 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 532 treesize of output 484 [2024-05-07 01:33:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1755137396, now seen corresponding path program 1 times [2024-05-07 01:33:50,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-07 01:33:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-07 01:33:50,626 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:33:50,627 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 514 treesize of output 462 [2024-05-07 01:33:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 2 times [2024-05-07 01:33:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:50,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:50,901 INFO L349 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2024-05-07 01:33:50,901 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 540 treesize of output 488 [2024-05-07 01:33:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2130497832, now seen corresponding path program 1 times [2024-05-07 01:33:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-07 01:33:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-07 01:33:51,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-07 01:33:51,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-05-07 01:33:51,731 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-05-07 01:33:51,731 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 270 treesize of output 242 [2024-05-07 01:33:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2100604285, now seen corresponding path program 3 times [2024-05-07 01:33:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-07 01:33:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-07 01:33:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-07 01:33:52,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-07 01:33:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat