/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-aee53f6 [2024-11-15 21:35:53,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-15 21:35:53,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-15 21:35:53,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-15 21:35:53,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-15 21:35:53,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-15 21:35:53,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-15 21:35:53,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-15 21:35:53,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-15 21:35:53,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-15 21:35:53,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-15 21:35:53,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-15 21:35:53,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-15 21:35:53,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-15 21:35:53,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-15 21:35:53,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-15 21:35:53,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-15 21:35:53,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 21:35:53,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-15 21:35:53,325 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-15 21:35:53,326 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-15 21:35:53,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-15 21:35:53,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-15 21:35:53,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-15 21:35:53,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-15 21:35:53,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-15 21:35:53,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-15 21:35:53,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i [2024-11-15 21:35:54,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-15 21:35:55,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-15 21:35:55,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i [2024-11-15 21:35:55,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/46b8e5b5c/ad1518e9568c487391d31c9dc7fa2d23/FLAG9ffa741a1 [2024-11-15 21:35:55,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/46b8e5b5c/ad1518e9568c487391d31c9dc7fa2d23 [2024-11-15 21:35:55,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-15 21:35:55,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-15 21:35:55,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-15 21:35:55,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-15 21:35:55,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-15 21:35:55,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aa27ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55, skipping insertion in model container [2024-11-15 21:35:55,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-15 21:35:55,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i[30703,30716] [2024-11-15 21:35:55,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 21:35:55,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-15 21:35:55,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/35_double_lock_p3_vs.i[30703,30716] [2024-11-15 21:35:55,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-15 21:35:55,912 INFO L204 MainTranslator]: Completed translation [2024-11-15 21:35:55,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55 WrapperNode [2024-11-15 21:35:55,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-15 21:35:55,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-15 21:35:55,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-15 21:35:55,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-15 21:35:55,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,951 INFO L138 Inliner]: procedures = 167, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2024-11-15 21:35:55,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-15 21:35:55,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-15 21:35:55,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-15 21:35:55,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-15 21:35:55,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-15 21:35:55,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-15 21:35:55,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-15 21:35:55,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-15 21:35:55,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (1/1) ... [2024-11-15 21:35:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-15 21:35:56,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:35:56,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-15 21:35:56,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-15 21:35:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-15 21:35:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-15 21:35:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-15 21:35:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-15 21:35:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-15 21:35:56,044 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-15 21:35:56,157 INFO L238 CfgBuilder]: Building ICFG [2024-11-15 21:35:56,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-15 21:35:56,339 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-15 21:35:56,339 INFO L287 CfgBuilder]: Performing block encoding [2024-11-15 21:35:56,370 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-15 21:35:56,370 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-15 21:35:56,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:35:56 BoogieIcfgContainer [2024-11-15 21:35:56,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-15 21:35:56,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-15 21:35:56,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-15 21:35:56,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-15 21:35:56,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:35:55" (1/3) ... [2024-11-15 21:35:56,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30efd8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:35:56, skipping insertion in model container [2024-11-15 21:35:56,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:55" (2/3) ... [2024-11-15 21:35:56,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30efd8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:35:56, skipping insertion in model container [2024-11-15 21:35:56,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:35:56" (3/3) ... [2024-11-15 21:35:56,383 INFO L112 eAbstractionObserver]: Analyzing ICFG 35_double_lock_p3_vs.i [2024-11-15 21:35:56,396 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-15 21:35:56,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG 35_double_lock_p3_vs.i that has 3 procedures, 81 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-15 21:35:56,400 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-15 21:35:56,474 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:35:56,528 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:35:56,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-15 21:35:56,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-15 21:35:56,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-15 21:35:56,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-15 21:35:56,607 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:35:56,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork1 ======== [2024-11-15 21:35:56,627 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:35:56,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:35:56,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:35:56,769 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:35:56,770 INFO L132 ounterexampleChecker]: Examining path program with hash -921075857, occurence #1 [2024-11-15 21:35:56,770 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:35:56,770 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:35:56,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:35:56,775 INFO L85 PathProgramCache]: Analyzing trace with hash 520129164, now seen corresponding path program 1 times [2024-11-15 21:35:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:35:56,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918634801] [2024-11-15 21:35:56,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:35:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:35:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:35:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:35:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:35:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918634801] [2024-11-15 21:35:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918634801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:35:57,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:35:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:35:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185577472] [2024-11-15 21:35:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:35:57,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:35:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:35:57,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:35:57,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:35:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:57,066 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:35:57,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-15 21:35:57,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:35:57,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-15 21:35:57,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:35:57,620 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:35:57,620 INFO L132 ounterexampleChecker]: Examining path program with hash 201915700, occurence #1 [2024-11-15 21:35:57,620 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:35:57,620 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:35:57,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:35:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 832997510, now seen corresponding path program 1 times [2024-11-15 21:35:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:35:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120161393] [2024-11-15 21:35:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:35:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:35:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:35:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:35:58,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:35:58,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120161393] [2024-11-15 21:35:58,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120161393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:35:58,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:35:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-15 21:35:58,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98432945] [2024-11-15 21:35:58,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:35:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-15 21:35:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:35:58,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-15 21:35:58,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-15 21:35:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:58,005 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:35:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-11-15 21:35:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:35:58,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:35:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:35:59,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:35:59,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-15 21:35:59,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-15 21:35:59,331 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork1 was SAFE (1/2) [2024-11-15 21:35:59,338 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:35:59,339 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:35:59,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:35:59,343 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:35:59,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-15 21:35:59,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:35:59,357 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:35:59,357 INFO L132 ounterexampleChecker]: Examining path program with hash 1737040218, occurence #1 [2024-11-15 21:35:59,357 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:35:59,357 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:35:59,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:35:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1453375866, now seen corresponding path program 1 times [2024-11-15 21:35:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:35:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936378633] [2024-11-15 21:35:59,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:35:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:35:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:35:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:35:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:35:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936378633] [2024-11-15 21:35:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936378633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:35:59,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:35:59,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:35:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156042775] [2024-11-15 21:35:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:35:59,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:35:59,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:35:59,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:35:59,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:35:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:59,448 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:35:59,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-15 21:35:59,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:35:59,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-15 21:35:59,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:35:59,490 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:35:59,490 INFO L132 ounterexampleChecker]: Examining path program with hash 426936631, occurence #1 [2024-11-15 21:35:59,490 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:35:59,490 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:35:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:35:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -395747682, now seen corresponding path program 1 times [2024-11-15 21:35:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:35:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969294146] [2024-11-15 21:35:59,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:35:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:35:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:35:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:35:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:35:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969294146] [2024-11-15 21:35:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969294146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:35:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:35:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-15 21:35:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15043483] [2024-11-15 21:35:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:35:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-15 21:35:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:35:59,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-15 21:35:59,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-15 21:35:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:59,707 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:35:59,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 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-11-15 21:35:59,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:35:59,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:35:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:35:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:35:59,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-15 21:35:59,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:35:59,855 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:35:59,856 INFO L132 ounterexampleChecker]: Examining path program with hash -1752553729, occurence #1 [2024-11-15 21:35:59,856 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:35:59,856 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:35:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:35:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2078414531, now seen corresponding path program 1 times [2024-11-15 21:35:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:35:59,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900820170] [2024-11-15 21:35:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:35:59,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:35:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:35:59,880 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:35:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:35:59,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:35:59,926 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:35:59,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-15 21:35:59,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-15 21:35:59,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-15 21:35:59,928 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-15 21:35:59,928 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-11-15 21:35:59,929 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:35:59,929 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-15 21:35:59,960 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:35:59,964 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:35:59,974 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:35:59,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:35:59,974 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:35:59,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-15 21:36:00,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:00,672 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:00,672 INFO L132 ounterexampleChecker]: Examining path program with hash 1398414245, occurence #1 [2024-11-15 21:36:00,672 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:00,672 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:00,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2015926313, now seen corresponding path program 1 times [2024-11-15 21:36:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:00,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265142173] [2024-11-15 21:36:00,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265142173] [2024-11-15 21:36:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265142173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:00,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:36:00,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800187553] [2024-11-15 21:36:00,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:00,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:36:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:00,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:36:00,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:36:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:00,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:00,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-11-15 21:36:00,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-15 21:36:00,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:00,938 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:00,938 INFO L132 ounterexampleChecker]: Examining path program with hash 705637384, occurence #1 [2024-11-15 21:36:00,939 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:00,939 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:00,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash -924232867, now seen corresponding path program 1 times [2024-11-15 21:36:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:00,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867205844] [2024-11-15 21:36:00,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:01,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867205844] [2024-11-15 21:36:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867205844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:01,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:01,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:36:01,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422149354] [2024-11-15 21:36:01,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:01,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:36:01,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:01,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:36:01,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:36:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:01,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-11-15 21:36:01,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-15 21:36:01,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:01,140 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:01,140 INFO L132 ounterexampleChecker]: Examining path program with hash -1857677386, occurence #1 [2024-11-15 21:36:01,140 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:01,140 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:01,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1528267111, now seen corresponding path program 1 times [2024-11-15 21:36:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828581931] [2024-11-15 21:36:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:01,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828581931] [2024-11-15 21:36:01,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828581931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:01,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:01,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-15 21:36:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314091684] [2024-11-15 21:36:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:01,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-15 21:36:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:01,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-15 21:36:01,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-15 21:36:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:01,312 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:01,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-11-15 21:36:01,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:01,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-15 21:36:01,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:01,588 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:01,588 INFO L132 ounterexampleChecker]: Examining path program with hash 1942104222, occurence #1 [2024-11-15 21:36:01,588 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:01,588 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2081572829, now seen corresponding path program 2 times [2024-11-15 21:36:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220692957] [2024-11-15 21:36:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220692957] [2024-11-15 21:36:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220692957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-15 21:36:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210507139] [2024-11-15 21:36:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-15 21:36:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-15 21:36:01,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-15 21:36:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:01,948 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:01,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:36:01,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:01,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:01,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:02,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-15 21:36:02,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:02,288 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:02,288 INFO L132 ounterexampleChecker]: Examining path program with hash 1740556296, occurence #1 [2024-11-15 21:36:02,288 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:02,288 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2050022183, now seen corresponding path program 1 times [2024-11-15 21:36:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040736459] [2024-11-15 21:36:02,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:36:02,324 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:36:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:36:02,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:36:02,361 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:36:02,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-15 21:36:02,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-15 21:36:02,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-15 21:36:02,362 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-15 21:36:02,363 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/3) [2024-11-15 21:36:02,363 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:36:02,363 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-15 21:36:02,393 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:36:02,399 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:02,413 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:36:02,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork1 ======== [2024-11-15 21:36:02,413 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:02,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:36:02,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:36:02,418 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-15 21:36:02,418 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork1 was SAFE (1/4) [2024-11-15 21:36:02,421 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:02,422 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:36:02,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-15 21:36:02,423 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:02,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-15 21:36:03,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:03,575 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:03,576 INFO L132 ounterexampleChecker]: Examining path program with hash 1910307777, occurence #1 [2024-11-15 21:36:03,576 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:03,576 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1450748754, now seen corresponding path program 1 times [2024-11-15 21:36:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566847541] [2024-11-15 21:36:03,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:03,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566847541] [2024-11-15 21:36:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566847541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:03,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:36:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081941115] [2024-11-15 21:36:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:03,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:36:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:03,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:36:03,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:36:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:03,650 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-11-15 21:36:03,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:03,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-15 21:36:03,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:03,856 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:03,856 INFO L132 ounterexampleChecker]: Examining path program with hash -1077887886, occurence #1 [2024-11-15 21:36:03,856 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:03,857 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 91853278, now seen corresponding path program 1 times [2024-11-15 21:36:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008911187] [2024-11-15 21:36:03,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:04,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008911187] [2024-11-15 21:36:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008911187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:04,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:04,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:36:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371945298] [2024-11-15 21:36:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:04,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:36:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:04,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:36:04,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:36:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:04,047 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:04,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-11-15 21:36:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-15 21:36:04,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:04,127 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:04,127 INFO L132 ounterexampleChecker]: Examining path program with hash -1528861915, occurence #1 [2024-11-15 21:36:04,127 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:04,127 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:04,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1439977467, now seen corresponding path program 1 times [2024-11-15 21:36:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473837564] [2024-11-15 21:36:04,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:04,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473837564] [2024-11-15 21:36:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473837564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-15 21:36:04,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263443180] [2024-11-15 21:36:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:04,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-15 21:36:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:04,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-15 21:36:04,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-15 21:36:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:04,310 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:04,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-15 21:36:04,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-15 21:36:04,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:04,580 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:04,580 INFO L132 ounterexampleChecker]: Examining path program with hash -1750529438, occurence #1 [2024-11-15 21:36:04,580 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:04,580 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:04,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -824517030, now seen corresponding path program 1 times [2024-11-15 21:36:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081612460] [2024-11-15 21:36:04,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:04,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:04,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081612460] [2024-11-15 21:36:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081612460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:04,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-15 21:36:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632679025] [2024-11-15 21:36:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:04,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-15 21:36:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:04,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-15 21:36:04,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-15 21:36:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:04,880 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 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-11-15 21:36:04,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:04,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:04,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:05,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:05,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-15 21:36:05,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:05,366 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:05,367 INFO L132 ounterexampleChecker]: Examining path program with hash 1423268075, occurence #1 [2024-11-15 21:36:05,367 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:05,367 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:05,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1037468970, now seen corresponding path program 2 times [2024-11-15 21:36:05,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:05,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946303864] [2024-11-15 21:36:05,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:05,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-11-15 21:36:05,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:05,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946303864] [2024-11-15 21:36:05,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946303864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:05,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:05,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-15 21:36:05,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234143286] [2024-11-15 21:36:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:05,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-15 21:36:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:05,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-15 21:36:05,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-15 21:36:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:05,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:05,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 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-11-15 21:36:05,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:05,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:05,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:05,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:05,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-15 21:36:06,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-15 21:36:06,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-15 21:36:06,426 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:06,426 INFO L132 ounterexampleChecker]: Examining path program with hash -2045039743, occurence #1 [2024-11-15 21:36:06,426 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:06,427 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1467933022, now seen corresponding path program 1 times [2024-11-15 21:36:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437203744] [2024-11-15 21:36:06,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:06,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:36:06,459 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-15 21:36:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-15 21:36:06,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-15 21:36:06,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-15 21:36:06,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-15 21:36:06,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-11-15 21:36:06,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-15 21:36:06,513 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-15 21:36:06,513 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/4) [2024-11-15 21:36:06,513 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-15 21:36:06,513 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-15 21:36:06,543 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-15 21:36:06,546 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,561 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:36:06,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork1 ======== [2024-11-15 21:36:06,562 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:36:06,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:36:06,565 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-15 21:36:06,565 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of4ForFork1 was SAFE (1/5) [2024-11-15 21:36:06,570 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,571 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:36:06,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread4of4ForFork1 ======== [2024-11-15 21:36:06,571 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:36:06,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:36:06,577 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-15 21:36:06,578 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread4of4ForFork1 was SAFE (2/5) [2024-11-15 21:36:06,583 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,583 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:36:06,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread2of4ForFork1 ======== [2024-11-15 21:36:06,584 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:36:06,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-15 21:36:06,588 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-15 21:36:06,588 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread2of4ForFork1 was SAFE (3/5) [2024-11-15 21:36:06,592 INFO L126 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,593 INFO L181 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-15 21:36:06,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of4ForFork1 ======== [2024-11-15 21:36:06,593 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4de70f0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-15 21:36:06,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-15 21:36:06,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:36:06,738 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:06,738 INFO L132 ounterexampleChecker]: Examining path program with hash 105250970, occurence #1 [2024-11-15 21:36:06,738 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:06,738 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1910412377, now seen corresponding path program 1 times [2024-11-15 21:36:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996961470] [2024-11-15 21:36:06,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:06,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-11-15 21:36:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996961470] [2024-11-15 21:36:06,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996961470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:06,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:36:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765738323] [2024-11-15 21:36:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:06,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:36:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:06,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:36:06,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:36:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:06,765 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:06,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-15 21:36:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:07,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-15 21:36:07,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:36:07,533 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:07,533 INFO L132 ounterexampleChecker]: Examining path program with hash -533537937, occurence #1 [2024-11-15 21:36:07,533 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:07,533 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash -512817248, now seen corresponding path program 1 times [2024-11-15 21:36:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138598302] [2024-11-15 21:36:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:07,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:07,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138598302] [2024-11-15 21:36:07,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138598302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-15 21:36:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342550473] [2024-11-15 21:36:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:07,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-15 21:36:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:07,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-15 21:36:07,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-15 21:36:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:07,657 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:07,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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-11-15 21:36:07,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:07,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-15 21:36:08,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:36:08,355 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:08,355 INFO L132 ounterexampleChecker]: Examining path program with hash 1223976428, occurence #1 [2024-11-15 21:36:08,355 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:08,355 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:08,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -188184473, now seen corresponding path program 1 times [2024-11-15 21:36:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:08,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270967639] [2024-11-15 21:36:08,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:08,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270967639] [2024-11-15 21:36:08,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270967639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:08,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:08,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-15 21:36:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128982321] [2024-11-15 21:36:08,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:08,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-15 21:36:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:08,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-15 21:36:08,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-15 21:36:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:08,583 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:08,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 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-11-15 21:36:08,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:08,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:08,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:09,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-15 21:36:09,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:36:09,427 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:09,428 INFO L132 ounterexampleChecker]: Examining path program with hash 2117136508, occurence #1 [2024-11-15 21:36:09,428 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:09,428 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:09,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash -738052434, now seen corresponding path program 1 times [2024-11-15 21:36:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:09,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405128753] [2024-11-15 21:36:09,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:09,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-11-15 21:36:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:09,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405128753] [2024-11-15 21:36:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405128753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:09,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-15 21:36:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002954250] [2024-11-15 21:36:09,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:09,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-15 21:36:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:09,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-15 21:36:09,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-15 21:36:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:09,827 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:09,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 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-11-15 21:36:09,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:09,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:09,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:09,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-15 21:36:10,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-15 21:36:10,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:36:10,909 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:10,909 INFO L132 ounterexampleChecker]: Examining path program with hash 624585841, occurence #1 [2024-11-15 21:36:10,909 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:10,909 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash -934595979, now seen corresponding path program 1 times [2024-11-15 21:36:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263888569] [2024-11-15 21:36:10,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:11,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-11-15 21:36:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263888569] [2024-11-15 21:36:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263888569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-15 21:36:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912786188] [2024-11-15 21:36:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:11,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-15 21:36:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:11,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-15 21:36:11,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2024-11-15 21:36:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:11,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:11,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 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-11-15 21:36:11,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:11,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:11,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:11,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-15 21:36:11,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-15 21:36:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-15 21:36:16,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-15 21:36:16,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-15 21:36:16,862 INFO L312 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-15 21:36:16,862 INFO L132 ounterexampleChecker]: Examining path program with hash -1583928553, occurence #1 [2024-11-15 21:36:16,862 INFO L134 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-15 21:36:16,862 INFO L322 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-15 21:36:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-15 21:36:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2074002065, now seen corresponding path program 2 times [2024-11-15 21:36:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-15 21:36:16,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556578534] [2024-11-15 21:36:16,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-15 21:36:16,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-15 21:36:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-15 21:36:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-15 21:36:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-15 21:36:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556578534] [2024-11-15 21:36:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556578534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-15 21:36:16,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-15 21:36:16,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-15 21:36:16,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614676046] [2024-11-15 21:36:16,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-15 21:36:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-15 21:36:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-15 21:36:16,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-15 21:36:16,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-15 21:36:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-15 21:36:16,979 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-15 21:36:16,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-11-15 21:36:16,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-15 21:36:16,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-15 21:36:16,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-15 21:36:16,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-15 21:36:16,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-11-15 21:36:16,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.