./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 19:15:25,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 19:15:25,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 19:15:25,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 19:15:25,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 19:15:25,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 19:15:25,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 19:15:25,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 19:15:25,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 19:15:25,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 19:15:25,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 19:15:25,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 19:15:25,414 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 19:15:25,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 19:15:25,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 19:15:25,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:15:25,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 19:15:25,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:15:25,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 19:15:25,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2025-04-24 19:15:25,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 19:15:25,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 19:15:25,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 19:15:25,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 19:15:25,623 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 19:15:25,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2025-04-24 19:15:26,923 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6d9f515d6/2c8eb0e1b6504a0b829ee817c5135d9f/FLAG243d5dbfb [2025-04-24 19:15:27,198 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 19:15:27,200 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2025-04-24 19:15:27,216 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6d9f515d6/2c8eb0e1b6504a0b829ee817c5135d9f/FLAG243d5dbfb [2025-04-24 19:15:27,973 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6d9f515d6/2c8eb0e1b6504a0b829ee817c5135d9f [2025-04-24 19:15:27,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 19:15:27,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 19:15:27,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 19:15:27,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 19:15:27,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 19:15:27,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 07:15:27" (1/1) ... [2025-04-24 19:15:27,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27805dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:27, skipping insertion in model container [2025-04-24 19:15:27,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 07:15:27" (1/1) ... [2025-04-24 19:15:28,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 19:15:28,358 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i[41322,41335] [2025-04-24 19:15:28,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 19:15:28,398 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 19:15:28,442 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i[41322,41335] [2025-04-24 19:15:28,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 19:15:28,481 INFO L204 MainTranslator]: Completed translation [2025-04-24 19:15:28,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28 WrapperNode [2025-04-24 19:15:28,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 19:15:28,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 19:15:28,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 19:15:28,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 19:15:28,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,521 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-04-24 19:15:28,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 19:15:28,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 19:15:28,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 19:15:28,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 19:15:28,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 19:15:28,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 19:15:28,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 19:15:28,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 19:15:28,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (1/1) ... [2025-04-24 19:15:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 19:15:28,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:15:28,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 19:15:28,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-24 19:15:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-24 19:15:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 19:15:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 19:15:28,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 19:15:28,594 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 19:15:28,690 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 19:15:28,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 19:15:28,845 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 19:15:28,845 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 19:15:28,943 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 19:15:28,943 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-24 19:15:28,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 07:15:28 BoogieIcfgContainer [2025-04-24 19:15:28,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 19:15:28,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 19:15:28,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 19:15:28,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 19:15:28,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 07:15:27" (1/3) ... [2025-04-24 19:15:28,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330c227f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 07:15:28, skipping insertion in model container [2025-04-24 19:15:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 07:15:28" (2/3) ... [2025-04-24 19:15:28,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330c227f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 07:15:28, skipping insertion in model container [2025-04-24 19:15:28,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 07:15:28" (3/3) ... [2025-04-24 19:15:28,950 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2025-04-24 19:15:28,960 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 19:15:28,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_06-cond_racing1.i that has 2 procedures, 43 locations, 55 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-24 19:15:28,962 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 19:15:29,006 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-24 19:15:29,031 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:29,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 19:15:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 19:15:29,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 19:15:29,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 19:15:29,089 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:29,101 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:29,106 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:29,107 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:29,211 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:29,211 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:29,211 INFO L139 ounterexampleChecker]: Examining path program with hash -679896264, occurence #1 [2025-04-24 19:15:29,211 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:29,212 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:29,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -428894221, now seen corresponding path program 1 times [2025-04-24 19:15:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:29,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920502930] [2025-04-24 19:15:29,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:29,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-24 19:15:29,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-24 19:15:29,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:29,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:29,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920502930] [2025-04-24 19:15:29,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920502930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139820581] [2025-04-24 19:15:29,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:29,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:29,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:29,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:29,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:29,375 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:29,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:29,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:29,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:29,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 19:15:29,458 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:29,458 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:29,458 INFO L139 ounterexampleChecker]: Examining path program with hash 663607228, occurence #1 [2025-04-24 19:15:29,458 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:29,458 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:29,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1233964943, now seen corresponding path program 1 times [2025-04-24 19:15:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:29,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586548358] [2025-04-24 19:15:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:29,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-24 19:15:29,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-24 19:15:29,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:29,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:29,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:29,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-24 19:15:29,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-24 19:15:29,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:29,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:29,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:29,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:29,531 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:29,533 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:29,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 19:15:29,537 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-24 19:15:29,538 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:29,538 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-24 19:15:29,552 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 19:15:29,557 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:29,562 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:29,563 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:29,564 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:29,565 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:29,738 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:29,738 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:29,738 INFO L139 ounterexampleChecker]: Examining path program with hash 610620342, occurence #1 [2025-04-24 19:15:29,738 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:29,738 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:29,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1677193316, now seen corresponding path program 1 times [2025-04-24 19:15:29,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:29,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598319691] [2025-04-24 19:15:29,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:29,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 19:15:29,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 19:15:29,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:29,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:29,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598319691] [2025-04-24 19:15:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598319691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:29,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692531296] [2025-04-24 19:15:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:29,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:29,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:29,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:29,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:29,803 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:29,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:29,804 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,067 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 19:15:30,068 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:30,068 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:30,068 INFO L139 ounterexampleChecker]: Examining path program with hash -1831521482, occurence #1 [2025-04-24 19:15:30,068 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:30,068 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:30,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1894801174, now seen corresponding path program 1 times [2025-04-24 19:15:30,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:30,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373674151] [2025-04-24 19:15:30,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:30,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 19:15:30,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 19:15:30,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:30,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:30,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373674151] [2025-04-24 19:15:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373674151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:30,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:30,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939883208] [2025-04-24 19:15:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:30,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:30,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:30,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:30,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,213 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:30,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:30,213 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,213 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:30,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 19:15:30,339 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:30,339 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:30,339 INFO L139 ounterexampleChecker]: Examining path program with hash -927677922, occurence #1 [2025-04-24 19:15:30,339 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:30,339 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:30,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 994183279, now seen corresponding path program 1 times [2025-04-24 19:15:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:30,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392107874] [2025-04-24 19:15:30,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:30,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:30,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 19:15:30,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 19:15:30,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:30,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:30,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:30,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392107874] [2025-04-24 19:15:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392107874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:30,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 19:15:30,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794843299] [2025-04-24 19:15:30,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:30,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 19:15:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 19:15:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-24 19:15:30,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,487 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:30,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:30,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:30,488 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:30,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:30,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 19:15:30,561 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:30,562 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:30,562 INFO L139 ounterexampleChecker]: Examining path program with hash -712165706, occurence #1 [2025-04-24 19:15:30,562 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:30,562 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:30,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 917232622, now seen corresponding path program 1 times [2025-04-24 19:15:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:30,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776906974] [2025-04-24 19:15:30,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:30,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-24 19:15:30,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-24 19:15:30,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:30,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:30,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:30,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-24 19:15:30,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-24 19:15:30,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:30,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:30,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:30,592 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:30,592 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:30,592 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:30,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 19:15:30,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:30,594 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:30,594 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-24 19:15:30,609 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 19:15:30,611 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:30,618 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:30,618 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:30,618 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:30,619 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:30,897 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:30,897 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:30,898 INFO L139 ounterexampleChecker]: Examining path program with hash -1156619672, occurence #1 [2025-04-24 19:15:30,898 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:30,898 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:30,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2043634724, now seen corresponding path program 1 times [2025-04-24 19:15:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:30,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082747310] [2025-04-24 19:15:30,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:30,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-24 19:15:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-24 19:15:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:30,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082747310] [2025-04-24 19:15:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082747310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:30,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:30,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:30,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096399670] [2025-04-24 19:15:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:30,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:30,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:30,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:30,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:30,926 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:30,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:30,926 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 19:15:31,528 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:31,528 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:31,528 INFO L139 ounterexampleChecker]: Examining path program with hash 1916489266, occurence #1 [2025-04-24 19:15:31,528 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:31,528 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:31,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1567603608, now seen corresponding path program 1 times [2025-04-24 19:15:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:31,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505605388] [2025-04-24 19:15:31,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:31,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-24 19:15:31,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-24 19:15:31,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:31,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:31,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505605388] [2025-04-24 19:15:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505605388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186297746] [2025-04-24 19:15:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:31,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:31,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:31,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:31,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:31,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,606 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:31,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:31,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,606 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:31,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 19:15:31,728 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:31,728 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:31,728 INFO L139 ounterexampleChecker]: Examining path program with hash -1418347027, occurence #1 [2025-04-24 19:15:31,728 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:31,728 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:31,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1010270613, now seen corresponding path program 1 times [2025-04-24 19:15:31,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:31,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136628159] [2025-04-24 19:15:31,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:31,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:31,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-24 19:15:31,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 19:15:31,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:31,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:31,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136628159] [2025-04-24 19:15:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136628159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048861842] [2025-04-24 19:15:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:31,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:31,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:31,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:31,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,867 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:31,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:31,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:31,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:31,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:32,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:32,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:32,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:32,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 19:15:32,023 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:32,023 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:32,023 INFO L139 ounterexampleChecker]: Examining path program with hash 1868639266, occurence #1 [2025-04-24 19:15:32,023 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:32,023 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:32,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash -998248132, now seen corresponding path program 1 times [2025-04-24 19:15:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:32,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119242285] [2025-04-24 19:15:32,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:32,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 19:15:32,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 19:15:32,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:32,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:32,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:32,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-24 19:15:32,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-24 19:15:32,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:32,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:32,063 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:32,063 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:32,063 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:32,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-24 19:15:32,066 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:32,066 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:32,066 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-24 19:15:32,087 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-24 19:15:32,091 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:32,099 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:32,100 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:32,101 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:32,101 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:32,436 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:32,436 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:32,436 INFO L139 ounterexampleChecker]: Examining path program with hash -1794892938, occurence #1 [2025-04-24 19:15:32,436 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:32,436 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:32,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1002476322, now seen corresponding path program 1 times [2025-04-24 19:15:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:32,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287144482] [2025-04-24 19:15:32,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:32,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-24 19:15:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-24 19:15:32,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:32,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:32,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:32,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287144482] [2025-04-24 19:15:32,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287144482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:32,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:32,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199066861] [2025-04-24 19:15:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:32,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:32,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:32,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:32,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:32,465 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:32,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:32,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-24 19:15:33,338 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:33,338 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:33,338 INFO L139 ounterexampleChecker]: Examining path program with hash -1698934397, occurence #1 [2025-04-24 19:15:33,338 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:33,338 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:33,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1949613459, now seen corresponding path program 1 times [2025-04-24 19:15:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:33,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243977270] [2025-04-24 19:15:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:33,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-24 19:15:33,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-24 19:15:33,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:33,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:33,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243977270] [2025-04-24 19:15:33,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243977270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:33,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:33,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:33,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521662337] [2025-04-24 19:15:33,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:33,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:33,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:33,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:33,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,421 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:33,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:33,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,421 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:33,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-24 19:15:33,576 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:33,576 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:33,576 INFO L139 ounterexampleChecker]: Examining path program with hash -832459307, occurence #1 [2025-04-24 19:15:33,576 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:33,576 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:33,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1428836519, now seen corresponding path program 1 times [2025-04-24 19:15:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:33,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703280030] [2025-04-24 19:15:33,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:33,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:33,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 19:15:33,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 19:15:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:33,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703280030] [2025-04-24 19:15:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703280030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753118521] [2025-04-24 19:15:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:33,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:33,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:33,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:33,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,696 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:33,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:33,696 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,696 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:33,696 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:33,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:33,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:33,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-24 19:15:33,871 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:33,872 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:33,872 INFO L139 ounterexampleChecker]: Examining path program with hash -1471848068, occurence #1 [2025-04-24 19:15:33,872 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:33,872 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:33,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2048922776, now seen corresponding path program 1 times [2025-04-24 19:15:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:33,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542439921] [2025-04-24 19:15:33,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:33,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-24 19:15:33,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-24 19:15:33,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:33,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:33,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:33,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-24 19:15:33,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-24 19:15:33,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:33,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:33,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:33,897 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:33,897 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:33,897 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:33,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-24 19:15:33,898 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:33,898 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:33,898 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-24 19:15:33,912 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-24 19:15:33,916 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:33,928 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:33,928 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:33,928 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:33,928 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:34,367 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:34,368 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:34,368 INFO L139 ounterexampleChecker]: Examining path program with hash -388325262, occurence #1 [2025-04-24 19:15:34,368 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:34,368 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:34,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1860991283, now seen corresponding path program 1 times [2025-04-24 19:15:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:34,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987414578] [2025-04-24 19:15:34,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:34,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:34,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 19:15:34,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 19:15:34,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:34,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:34,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:34,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987414578] [2025-04-24 19:15:34,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987414578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:34,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:34,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163262438] [2025-04-24 19:15:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:34,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:34,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:34,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:34,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:34,389 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:34,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:34,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:35,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:35,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-24 19:15:35,660 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:35,660 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:35,661 INFO L139 ounterexampleChecker]: Examining path program with hash 549971829, occurence #1 [2025-04-24 19:15:35,661 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:35,661 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:35,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash 502479761, now seen corresponding path program 1 times [2025-04-24 19:15:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:35,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052399363] [2025-04-24 19:15:35,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:35,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-24 19:15:35,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-24 19:15:35,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:35,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:35,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:35,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052399363] [2025-04-24 19:15:35,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052399363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:35,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:35,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612551517] [2025-04-24 19:15:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:35,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:35,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:35,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:35,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:35,765 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:35,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:35,766 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:35,766 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:35,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:35,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:35,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-24 19:15:35,974 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:35,974 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:35,974 INFO L139 ounterexampleChecker]: Examining path program with hash 1563977745, occurence #1 [2025-04-24 19:15:35,974 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:35,974 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:35,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1559979234, now seen corresponding path program 1 times [2025-04-24 19:15:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:35,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317255976] [2025-04-24 19:15:35,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:35,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-24 19:15:35,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-24 19:15:35,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:35,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:36,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:36,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317255976] [2025-04-24 19:15:36,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317255976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:36,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:36,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:36,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105203664] [2025-04-24 19:15:36,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:36,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:36,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:36,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:36,076 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:36,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:36,076 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:36,076 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:36,076 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:36,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:36,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:36,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:36,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-24 19:15:36,308 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:36,308 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:36,308 INFO L139 ounterexampleChecker]: Examining path program with hash 79975745, occurence #1 [2025-04-24 19:15:36,308 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:36,308 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:36,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash -904854289, now seen corresponding path program 1 times [2025-04-24 19:15:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:36,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535320474] [2025-04-24 19:15:36,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:36,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 19:15:36,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 19:15:36,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:36,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:36,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:36,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 19:15:36,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 19:15:36,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:36,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:36,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:36,335 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:36,335 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:36,335 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:36,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-24 19:15:36,336 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:36,336 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:36,336 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-24 19:15:36,356 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-24 19:15:36,358 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:36,367 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:36,368 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:36,368 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:36,368 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:36,917 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:36,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:36,917 INFO L139 ounterexampleChecker]: Examining path program with hash 664870579, occurence #1 [2025-04-24 19:15:36,917 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:36,917 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:36,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1181928096, now seen corresponding path program 1 times [2025-04-24 19:15:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:36,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603653584] [2025-04-24 19:15:36,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:36,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-24 19:15:36,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-24 19:15:36,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:36,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:36,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603653584] [2025-04-24 19:15:36,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603653584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:36,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:36,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:36,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243643179] [2025-04-24 19:15:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:36,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:36,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:36,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:36,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:36,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:36,935 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:36,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:36,935 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-24 19:15:38,480 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:38,480 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:38,480 INFO L139 ounterexampleChecker]: Examining path program with hash -1009462585, occurence #1 [2025-04-24 19:15:38,480 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:38,480 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:38,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1337318261, now seen corresponding path program 1 times [2025-04-24 19:15:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:38,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736950075] [2025-04-24 19:15:38,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:38,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-24 19:15:38,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-24 19:15:38,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:38,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736950075] [2025-04-24 19:15:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736950075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:38,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:38,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653967927] [2025-04-24 19:15:38,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:38,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:38,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:38,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:38,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:38,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,572 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:38,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:38,572 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,572 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:38,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-24 19:15:38,877 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:38,877 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:38,877 INFO L139 ounterexampleChecker]: Examining path program with hash 516115581, occurence #1 [2025-04-24 19:15:38,877 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:38,877 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:38,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1288791455, now seen corresponding path program 1 times [2025-04-24 19:15:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:38,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965180172] [2025-04-24 19:15:38,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:38,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-24 19:15:38,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-24 19:15:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:38,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965180172] [2025-04-24 19:15:38,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965180172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:38,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:38,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:38,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74383884] [2025-04-24 19:15:38,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:38,979 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:38,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:38,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:38,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,979 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:38,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:38,979 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:38,980 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:38,980 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:39,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:39,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:39,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:39,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-24 19:15:39,400 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:39,400 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:39,400 INFO L139 ounterexampleChecker]: Examining path program with hash -1476163796, occurence #1 [2025-04-24 19:15:39,400 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:39,400 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:39,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2120595210, now seen corresponding path program 1 times [2025-04-24 19:15:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:39,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063757618] [2025-04-24 19:15:39,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:39,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-24 19:15:39,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-24 19:15:39,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:39,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:39,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:39,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-24 19:15:39,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-24 19:15:39,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:39,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:39,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:39,440 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:39,440 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:39,440 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:39,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-24 19:15:39,441 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:39,441 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:39,441 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-24 19:15:39,456 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-24 19:15:39,458 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:39,467 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:39,467 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:39,467 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:39,467 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:40,109 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:40,109 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:40,109 INFO L139 ounterexampleChecker]: Examining path program with hash -1248486310, occurence #1 [2025-04-24 19:15:40,109 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:40,109 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:40,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2116291290, now seen corresponding path program 1 times [2025-04-24 19:15:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:40,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412342476] [2025-04-24 19:15:40,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:40,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-24 19:15:40,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-24 19:15:40,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:40,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:40,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412342476] [2025-04-24 19:15:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412342476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:40,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570757388] [2025-04-24 19:15:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:40,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:40,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:40,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:40,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:40,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:40,126 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:40,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:40,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-24 19:15:42,083 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:42,083 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:42,083 INFO L139 ounterexampleChecker]: Examining path program with hash -140909469, occurence #1 [2025-04-24 19:15:42,083 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:42,083 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:42,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1574354962, now seen corresponding path program 1 times [2025-04-24 19:15:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:42,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366001324] [2025-04-24 19:15:42,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:42,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-24 19:15:42,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-24 19:15:42,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:42,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:42,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:42,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366001324] [2025-04-24 19:15:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366001324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:42,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:42,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:42,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278392884] [2025-04-24 19:15:42,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:42,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:42,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:42,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:42,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:42,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,176 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:42,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:42,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:42,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-24 19:15:42,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:42,509 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:42,509 INFO L139 ounterexampleChecker]: Examining path program with hash 1339308066, occurence #1 [2025-04-24 19:15:42,509 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:42,509 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:42,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1873104375, now seen corresponding path program 1 times [2025-04-24 19:15:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:42,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851066250] [2025-04-24 19:15:42,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:42,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-24 19:15:42,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-24 19:15:42,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:42,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:42,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851066250] [2025-04-24 19:15:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851066250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290611628] [2025-04-24 19:15:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:42,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:42,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:42,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:42,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,684 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:42,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:42,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:42,684 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:42,685 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:43,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:43,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:43,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:43,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-24 19:15:43,150 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:43,150 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:43,150 INFO L139 ounterexampleChecker]: Examining path program with hash -1437165306, occurence #1 [2025-04-24 19:15:43,150 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:43,150 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:43,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1472953335, now seen corresponding path program 1 times [2025-04-24 19:15:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:43,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343421097] [2025-04-24 19:15:43,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-24 19:15:43,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-24 19:15:43,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:43,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:43,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:43,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-24 19:15:43,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-24 19:15:43,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:43,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:43,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:43,185 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:43,185 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:43,185 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:43,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-24 19:15:43,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:43,187 WARN L247 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:43,187 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-04-24 19:15:43,205 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-24 19:15:43,208 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:43,221 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:43,221 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:43,222 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:43,222 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:44,028 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:44,029 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:44,029 INFO L139 ounterexampleChecker]: Examining path program with hash -2088707613, occurence #1 [2025-04-24 19:15:44,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:44,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:44,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash -441016446, now seen corresponding path program 1 times [2025-04-24 19:15:44,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:44,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122907657] [2025-04-24 19:15:44,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:44,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:44,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-24 19:15:44,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-24 19:15:44,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:44,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:44,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122907657] [2025-04-24 19:15:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122907657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690630315] [2025-04-24 19:15:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:44,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:44,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:44,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:44,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:44,049 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:44,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:44,049 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:46,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:46,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-24 19:15:46,359 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:46,359 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:46,359 INFO L139 ounterexampleChecker]: Examining path program with hash 1747897850, occurence #1 [2025-04-24 19:15:46,359 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:46,359 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:46,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 744837955, now seen corresponding path program 1 times [2025-04-24 19:15:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:46,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794158595] [2025-04-24 19:15:46,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:46,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-24 19:15:46,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-24 19:15:46,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:46,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794158595] [2025-04-24 19:15:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794158595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:46,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22273329] [2025-04-24 19:15:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:46,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:46,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:46,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:46,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:46,473 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:46,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:46,473 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:46,473 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:46,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:46,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:46,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-24 19:15:46,888 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:46,888 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:46,888 INFO L139 ounterexampleChecker]: Examining path program with hash -1324755091, occurence #1 [2025-04-24 19:15:46,888 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:46,888 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:46,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:46,888 INFO L85 PathProgramCache]: Analyzing trace with hash -625098034, now seen corresponding path program 1 times [2025-04-24 19:15:46,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:46,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934439720] [2025-04-24 19:15:46,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:46,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:46,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-24 19:15:46,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-24 19:15:46,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:46,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:47,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934439720] [2025-04-24 19:15:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934439720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139444953] [2025-04-24 19:15:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:47,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:47,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:47,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:47,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:47,006 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:47,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:47,007 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:47,007 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:47,007 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:47,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:47,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:47,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:47,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-24 19:15:47,603 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:47,603 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:47,603 INFO L139 ounterexampleChecker]: Examining path program with hash -2102874990, occurence #1 [2025-04-24 19:15:47,603 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:47,603 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:47,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 252211169, now seen corresponding path program 1 times [2025-04-24 19:15:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:47,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714300128] [2025-04-24 19:15:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:47,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-24 19:15:47,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-24 19:15:47,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:47,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:47,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:47,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-24 19:15:47,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-24 19:15:47,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:47,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:47,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:47,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:47,651 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:47,651 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:47,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-24 19:15:47,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:47,654 WARN L247 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:47,654 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-04-24 19:15:47,675 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-24 19:15:47,678 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:47,691 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:47,691 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:47,691 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:47,691 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:48,586 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:48,586 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:48,586 INFO L139 ounterexampleChecker]: Examining path program with hash 1236770002, occurence #1 [2025-04-24 19:15:48,587 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:48,587 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:48,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 491524051, now seen corresponding path program 1 times [2025-04-24 19:15:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:48,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922083490] [2025-04-24 19:15:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:48,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-24 19:15:48,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-24 19:15:48,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:48,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:48,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:48,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922083490] [2025-04-24 19:15:48,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922083490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:48,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:48,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130855731] [2025-04-24 19:15:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:48,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:48,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:48,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:48,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:48,604 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:48,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 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) [2025-04-24 19:15:48,604 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:51,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:51,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-24 19:15:51,338 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:51,338 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:51,338 INFO L139 ounterexampleChecker]: Examining path program with hash 1130832479, occurence #1 [2025-04-24 19:15:51,338 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:51,338 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:51,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1990428099, now seen corresponding path program 1 times [2025-04-24 19:15:51,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:51,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302702] [2025-04-24 19:15:51,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:51,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-04-24 19:15:51,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-04-24 19:15:51,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:51,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:51,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:51,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302702] [2025-04-24 19:15:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:51,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135942905] [2025-04-24 19:15:51,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:51,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:51,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:51,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:51,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:51,414 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:51,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:51,414 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:51,414 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:51,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:51,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:51,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-24 19:15:51,902 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:51,902 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:51,902 INFO L139 ounterexampleChecker]: Examining path program with hash 1092675089, occurence #1 [2025-04-24 19:15:51,902 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:51,902 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:51,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1607204960, now seen corresponding path program 1 times [2025-04-24 19:15:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:51,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96619986] [2025-04-24 19:15:51,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:51,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-24 19:15:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-24 19:15:51,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:51,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:52,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96619986] [2025-04-24 19:15:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96619986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:52,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690207389] [2025-04-24 19:15:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:52,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:52,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:52,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:52,023 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:52,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:52,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:52,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:52,024 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:52,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:52,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:52,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:52,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-24 19:15:52,717 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:52,717 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:52,717 INFO L139 ounterexampleChecker]: Examining path program with hash -563940246, occurence #1 [2025-04-24 19:15:52,717 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:52,717 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:52,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1235135371, now seen corresponding path program 1 times [2025-04-24 19:15:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:52,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941004584] [2025-04-24 19:15:52,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:52,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-24 19:15:52,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-24 19:15:52,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:52,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:52,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:52,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-24 19:15:52,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-24 19:15:52,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:52,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:52,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:52,755 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:52,755 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:52,755 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:52,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-24 19:15:52,756 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:52,756 WARN L247 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:52,756 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-04-24 19:15:52,778 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-24 19:15:52,780 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:52,794 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:52,795 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:52,795 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:52,795 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:54,037 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:54,037 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:54,037 INFO L139 ounterexampleChecker]: Examining path program with hash 1684740251, occurence #1 [2025-04-24 19:15:54,037 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:54,037 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:54,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash 389163822, now seen corresponding path program 1 times [2025-04-24 19:15:54,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:54,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310580764] [2025-04-24 19:15:54,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:54,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:54,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-24 19:15:54,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-24 19:15:54,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:54,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:54,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310580764] [2025-04-24 19:15:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310580764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:54,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403449185] [2025-04-24 19:15:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:54,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:54,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:54,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:54,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:54,054 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:54,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:54,055 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-24 19:15:57,117 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:57,117 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:57,117 INFO L139 ounterexampleChecker]: Examining path program with hash -92958575, occurence #1 [2025-04-24 19:15:57,117 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:57,117 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:57,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1052912727, now seen corresponding path program 1 times [2025-04-24 19:15:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:57,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62540378] [2025-04-24 19:15:57,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:57,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-04-24 19:15:57,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-04-24 19:15:57,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:57,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:57,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62540378] [2025-04-24 19:15:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62540378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:57,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:57,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277529941] [2025-04-24 19:15:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:57,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:15:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:57,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:15:57,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:15:57,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,195 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:57,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:57,195 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,195 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:57,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-24 19:15:57,677 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:57,677 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:57,677 INFO L139 ounterexampleChecker]: Examining path program with hash -1925639861, occurence #1 [2025-04-24 19:15:57,677 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:57,677 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:57,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash -953059311, now seen corresponding path program 1 times [2025-04-24 19:15:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:57,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292675634] [2025-04-24 19:15:57,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:57,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:57,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-04-24 19:15:57,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-04-24 19:15:57,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:57,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:57,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:57,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292675634] [2025-04-24 19:15:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292675634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:15:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722742865] [2025-04-24 19:15:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:57,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:15:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:15:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:15:57,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,792 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:57,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:57,792 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:57,792 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:57,792 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:58,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:58,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:15:58,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:15:58,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-24 19:15:58,558 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:58,558 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:58,558 INFO L139 ounterexampleChecker]: Examining path program with hash -1998896417, occurence #1 [2025-04-24 19:15:58,558 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:58,558 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:58,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash 278763547, now seen corresponding path program 1 times [2025-04-24 19:15:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:58,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634037270] [2025-04-24 19:15:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:58,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-24 19:15:58,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-24 19:15:58,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:58,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:58,577 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:15:58,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-24 19:15:58,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-24 19:15:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:15:58,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:15:58,597 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:15:58,597 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:15:58,597 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:15:58,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-24 19:15:58,598 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:15:58,599 WARN L247 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:15:58,599 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-04-24 19:15:58,620 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2025-04-24 19:15:58,622 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:58,638 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:15:58,638 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:15:58,638 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:15:58,638 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:15:59,971 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:15:59,971 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:15:59,971 INFO L139 ounterexampleChecker]: Examining path program with hash -326115401, occurence #1 [2025-04-24 19:15:59,971 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:15:59,971 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:15:59,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:15:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash -747532856, now seen corresponding path program 1 times [2025-04-24 19:15:59,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:15:59,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89112372] [2025-04-24 19:15:59,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:15:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:15:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-24 19:15:59,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-24 19:15:59,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:15:59,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:15:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:15:59,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:15:59,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89112372] [2025-04-24 19:15:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89112372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:15:59,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:15:59,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:15:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495053191] [2025-04-24 19:15:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:15:59,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:15:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:15:59,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:15:59,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:15:59,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:15:59,998 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:15:59,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:15:59,998 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:03,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:03,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-24 19:16:03,525 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:03,525 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:03,525 INFO L139 ounterexampleChecker]: Examining path program with hash 1100940768, occurence #1 [2025-04-24 19:16:03,525 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:03,525 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:03,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1191457796, now seen corresponding path program 1 times [2025-04-24 19:16:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:03,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804953280] [2025-04-24 19:16:03,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:03,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-04-24 19:16:03,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-04-24 19:16:03,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:03,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:03,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:03,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804953280] [2025-04-24 19:16:03,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804953280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:03,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:03,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500462660] [2025-04-24 19:16:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:03,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:16:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:03,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:16:03,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:16:03,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:03,656 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:03,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:03,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:03,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:04,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:04,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:04,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-24 19:16:04,240 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:04,240 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:04,240 INFO L139 ounterexampleChecker]: Examining path program with hash -1821821974, occurence #1 [2025-04-24 19:16:04,240 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:04,240 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:04,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1624519772, now seen corresponding path program 1 times [2025-04-24 19:16:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:04,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642752353] [2025-04-24 19:16:04,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:04,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-04-24 19:16:04,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-04-24 19:16:04,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:04,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:04,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:04,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642752353] [2025-04-24 19:16:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642752353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544650207] [2025-04-24 19:16:04,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:04,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:16:04,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:04,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:16:04,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:16:04,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:04,369 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:04,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:04,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:04,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:04,369 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:05,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:05,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:05,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:16:05,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-24 19:16:05,320 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:05,320 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:05,320 INFO L139 ounterexampleChecker]: Examining path program with hash 454507206, occurence #1 [2025-04-24 19:16:05,320 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:05,320 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:05,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1287835300, now seen corresponding path program 1 times [2025-04-24 19:16:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:05,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777213274] [2025-04-24 19:16:05,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:05,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-24 19:16:05,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-24 19:16:05,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:05,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:16:05,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-24 19:16:05,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-24 19:16:05,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:05,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:05,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:16:05,405 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:16:05,405 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:16:05,405 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:16:05,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-24 19:16:05,407 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:16:05,407 WARN L247 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:16:05,407 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-04-24 19:16:05,430 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-04-24 19:16:05,432 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:05,454 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:16:05,455 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:16:05,455 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:05,455 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:16:06,899 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:06,899 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:06,899 INFO L139 ounterexampleChecker]: Examining path program with hash -631183895, occurence #1 [2025-04-24 19:16:06,899 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:06,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:06,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1175255216, now seen corresponding path program 1 times [2025-04-24 19:16:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:06,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022154095] [2025-04-24 19:16:06,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:06,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-04-24 19:16:06,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-04-24 19:16:06,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:06,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:06,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022154095] [2025-04-24 19:16:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022154095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:16:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662139863] [2025-04-24 19:16:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:06,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:16:06,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:06,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:16:06,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:16:06,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:06,922 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:06,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:06,922 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:11,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:11,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-24 19:16:11,210 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:11,210 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:11,210 INFO L139 ounterexampleChecker]: Examining path program with hash 746028375, occurence #1 [2025-04-24 19:16:11,210 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:11,210 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:11,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1725222006, now seen corresponding path program 1 times [2025-04-24 19:16:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:11,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714687306] [2025-04-24 19:16:11,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:11,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-04-24 19:16:11,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-04-24 19:16:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:11,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714687306] [2025-04-24 19:16:11,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714687306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:11,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235106404] [2025-04-24 19:16:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:11,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:16:11,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:11,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:16:11,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:16:11,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:11,295 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:11,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:11,295 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:11,295 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:11,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:11,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:11,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-24 19:16:11,982 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:11,982 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:11,982 INFO L139 ounterexampleChecker]: Examining path program with hash -745189551, occurence #1 [2025-04-24 19:16:11,982 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:11,982 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:11,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1489320816, now seen corresponding path program 1 times [2025-04-24 19:16:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:11,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863567345] [2025-04-24 19:16:11,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:11,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-04-24 19:16:12,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-04-24 19:16:12,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:12,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:12,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863567345] [2025-04-24 19:16:12,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863567345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:12,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:12,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:12,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391050403] [2025-04-24 19:16:12,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:12,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:16:12,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:12,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:16:12,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:16:12,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:12,191 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:12,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:12,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:12,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:12,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:13,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:13,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:13,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:16:13,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-24 19:16:13,343 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:13,343 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:13,344 INFO L139 ounterexampleChecker]: Examining path program with hash 231314463, occurence #1 [2025-04-24 19:16:13,344 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:13,344 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:13,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 348142887, now seen corresponding path program 1 times [2025-04-24 19:16:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:13,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542168522] [2025-04-24 19:16:13,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:13,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-24 19:16:13,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-24 19:16:13,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:13,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:13,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:16:13,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-24 19:16:13,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-24 19:16:13,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:13,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:13,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:16:13,388 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:16:13,388 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:16:13,388 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:16:13,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-24 19:16:13,390 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:16:13,390 WARN L247 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:16:13,390 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-04-24 19:16:13,414 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-04-24 19:16:13,416 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:13,433 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:16:13,433 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:16:13,433 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:13,433 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:16:15,133 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:15,133 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:15,133 INFO L139 ounterexampleChecker]: Examining path program with hash -1956985935, occurence #1 [2025-04-24 19:16:15,133 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:15,133 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:15,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash 336392621, now seen corresponding path program 1 times [2025-04-24 19:16:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:15,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413777561] [2025-04-24 19:16:15,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-24 19:16:15,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-24 19:16:15,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:15,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:15,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413777561] [2025-04-24 19:16:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413777561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:15,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:15,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:16:15,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443875758] [2025-04-24 19:16:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:15,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:16:15,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:15,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:16:15,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:16:15,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:15,156 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:15,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:15,156 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:20,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:20,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-24 19:16:20,065 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:20,065 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:20,066 INFO L139 ounterexampleChecker]: Examining path program with hash -1393603171, occurence #1 [2025-04-24 19:16:20,066 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:20,066 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:20,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash -638528726, now seen corresponding path program 1 times [2025-04-24 19:16:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:20,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313884780] [2025-04-24 19:16:20,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:20,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-24 19:16:20,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-24 19:16:20,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:20,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:20,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:20,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313884780] [2025-04-24 19:16:20,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313884780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:20,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:20,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466047677] [2025-04-24 19:16:20,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:20,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:16:20,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:20,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:16:20,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:16:20,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:20,162 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:20,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:20,163 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:20,163 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:20,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:20,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:20,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-24 19:16:20,880 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:20,880 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:20,880 INFO L139 ounterexampleChecker]: Examining path program with hash -1376045136, occurence #1 [2025-04-24 19:16:20,880 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:20,880 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:20,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash -985031961, now seen corresponding path program 1 times [2025-04-24 19:16:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:20,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995079350] [2025-04-24 19:16:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:20,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:20,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-24 19:16:20,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-24 19:16:20,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:21,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995079350] [2025-04-24 19:16:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995079350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:21,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504951349] [2025-04-24 19:16:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:21,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:16:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:21,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:16:21,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:16:21,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:21,031 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:21,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:21,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:21,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:21,031 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:22,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:22,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:22,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:16:22,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-24 19:16:22,403 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:22,403 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:22,403 INFO L139 ounterexampleChecker]: Examining path program with hash 2087155725, occurence #1 [2025-04-24 19:16:22,403 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:22,403 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:22,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1048194980, now seen corresponding path program 1 times [2025-04-24 19:16:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:22,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293442390] [2025-04-24 19:16:22,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:22,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-24 19:16:22,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-24 19:16:22,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:22,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:22,423 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:16:22,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-04-24 19:16:22,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-04-24 19:16:22,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:22,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:16:22,448 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:16:22,448 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:16:22,448 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:16:22,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-24 19:16:22,451 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:16:22,451 WARN L247 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:16:22,451 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-04-24 19:16:22,475 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2025-04-24 19:16:22,477 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:22,493 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:16:22,494 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:16:22,494 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:22,494 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:16:24,411 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:24,411 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:24,412 INFO L139 ounterexampleChecker]: Examining path program with hash -1096665156, occurence #1 [2025-04-24 19:16:24,412 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:24,412 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:24,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1130307718, now seen corresponding path program 1 times [2025-04-24 19:16:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:24,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053243567] [2025-04-24 19:16:24,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:24,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-04-24 19:16:24,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-04-24 19:16:24,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:24,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:24,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:24,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053243567] [2025-04-24 19:16:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053243567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:24,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:16:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103259670] [2025-04-24 19:16:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:24,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:16:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:24,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:16:24,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:16:24,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:24,434 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:24,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:24,434 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:30,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:30,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-24 19:16:30,077 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:30,077 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:30,077 INFO L139 ounterexampleChecker]: Examining path program with hash -2047032450, occurence #1 [2025-04-24 19:16:30,077 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:30,077 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:30,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2130106537, now seen corresponding path program 1 times [2025-04-24 19:16:30,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:30,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132393111] [2025-04-24 19:16:30,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:30,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:30,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-04-24 19:16:30,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-04-24 19:16:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:30,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:30,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:30,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132393111] [2025-04-24 19:16:30,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132393111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:30,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:30,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543868180] [2025-04-24 19:16:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:30,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:16:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:30,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:16:30,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:16:30,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:30,185 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:30,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:30,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:30,185 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:31,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:31,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:31,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-24 19:16:31,020 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:31,020 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:31,020 INFO L139 ounterexampleChecker]: Examining path program with hash 89548984, occurence #1 [2025-04-24 19:16:31,020 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:31,020 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:31,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2108874495, now seen corresponding path program 1 times [2025-04-24 19:16:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:31,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408609550] [2025-04-24 19:16:31,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:31,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-04-24 19:16:31,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-04-24 19:16:31,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:31,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:31,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408609550] [2025-04-24 19:16:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408609550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:31,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:31,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:31,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999148175] [2025-04-24 19:16:31,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:31,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:16:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:31,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:16:31,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:16:31,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:31,270 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:31,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:31,271 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:31,271 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:31,271 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:32,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:32,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:32,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:16:32,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-24 19:16:32,981 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:32,981 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:32,981 INFO L139 ounterexampleChecker]: Examining path program with hash -1429159150, occurence #1 [2025-04-24 19:16:32,981 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:32,981 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:32,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1388068024, now seen corresponding path program 1 times [2025-04-24 19:16:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:32,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971171121] [2025-04-24 19:16:32,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:32,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-24 19:16:33,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-24 19:16:33,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:33,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:33,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:16:33,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-24 19:16:33,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-24 19:16:33,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:33,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:33,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:16:33,035 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:16:33,036 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:16:33,036 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:16:33,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-24 19:16:33,037 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 19:16:33,038 WARN L247 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:16:33,038 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-04-24 19:16:33,068 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2025-04-24 19:16:33,071 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:33,090 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:16:33,091 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:16:33,092 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:33,092 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:16:35,398 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:35,398 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:35,399 INFO L139 ounterexampleChecker]: Examining path program with hash 466019882, occurence #1 [2025-04-24 19:16:35,399 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:35,399 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:35,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1947834186, now seen corresponding path program 1 times [2025-04-24 19:16:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:35,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836812918] [2025-04-24 19:16:35,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:35,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-04-24 19:16:35,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-04-24 19:16:35,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:35,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:35,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836812918] [2025-04-24 19:16:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836812918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:16:35,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627679533] [2025-04-24 19:16:35,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:35,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:16:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:35,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:16:35,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:16:35,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:35,428 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:35,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 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) [2025-04-24 19:16:35,428 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:41,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:41,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-24 19:16:41,618 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:41,618 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:41,619 INFO L139 ounterexampleChecker]: Examining path program with hash 76115481, occurence #1 [2025-04-24 19:16:41,619 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:41,619 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:41,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1537459426, now seen corresponding path program 1 times [2025-04-24 19:16:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:41,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907544173] [2025-04-24 19:16:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:41,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-04-24 19:16:41,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-04-24 19:16:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:41,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907544173] [2025-04-24 19:16:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907544173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450058443] [2025-04-24 19:16:41,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:41,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:16:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:41,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:16:41,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:16:41,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:41,861 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:41,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:41,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:41,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:42,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:42,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:42,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-24 19:16:42,927 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:42,927 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:42,927 INFO L139 ounterexampleChecker]: Examining path program with hash -514581285, occurence #1 [2025-04-24 19:16:42,927 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:42,927 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:42,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash 157229866, now seen corresponding path program 2 times [2025-04-24 19:16:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:42,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046359791] [2025-04-24 19:16:42,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:16:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:42,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 282 statements into 1 equivalence classes. [2025-04-24 19:16:42,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-04-24 19:16:42,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:16:42,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:43,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:43,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046359791] [2025-04-24 19:16:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046359791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:43,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618408315] [2025-04-24 19:16:43,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:43,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:16:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:43,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:16:43,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:16:43,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:43,123 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:43,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:43,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:43,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:43,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:45,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:45,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:45,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:16:45,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-24 19:16:45,170 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:45,170 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:45,170 INFO L139 ounterexampleChecker]: Examining path program with hash -1633293327, occurence #1 [2025-04-24 19:16:45,170 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:45,170 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:45,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1538136686, now seen corresponding path program 1 times [2025-04-24 19:16:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:45,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458400368] [2025-04-24 19:16:45,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:45,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-04-24 19:16:45,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-04-24 19:16:45,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:45,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:45,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:16:45,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-04-24 19:16:45,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-04-24 19:16:45,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:45,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:45,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:16:45,234 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:16:45,234 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:16:45,234 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:16:45,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-24 19:16:45,236 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:16:45,236 WARN L247 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:16:45,236 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-04-24 19:16:45,268 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-04-24 19:16:45,271 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:45,294 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:16:45,295 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:16:45,295 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:45,295 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:16:47,972 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:47,972 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:47,972 INFO L139 ounterexampleChecker]: Examining path program with hash -19330447, occurence #1 [2025-04-24 19:16:47,972 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:47,972 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:47,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash -590234872, now seen corresponding path program 1 times [2025-04-24 19:16:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:47,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741966540] [2025-04-24 19:16:47,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:47,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-04-24 19:16:47,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-04-24 19:16:47,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:47,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:47,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741966540] [2025-04-24 19:16:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741966540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:16:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375502838] [2025-04-24 19:16:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:47,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:16:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:47,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:16:47,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:16:47,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:47,998 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:47,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:47,998 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:55,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:55,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-24 19:16:55,050 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:55,050 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:55,050 INFO L139 ounterexampleChecker]: Examining path program with hash -552470017, occurence #1 [2025-04-24 19:16:55,050 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:55,050 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:55,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1884148286, now seen corresponding path program 1 times [2025-04-24 19:16:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:55,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343926171] [2025-04-24 19:16:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:55,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-04-24 19:16:55,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-04-24 19:16:55,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:55,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:55,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343926171] [2025-04-24 19:16:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343926171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:55,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:55,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588316911] [2025-04-24 19:16:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:55,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:16:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:55,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:16:55,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:16:55,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:55,168 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:55,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:55,168 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:55,168 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:56,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:56,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:56,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-24 19:16:56,073 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:56,073 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:56,073 INFO L139 ounterexampleChecker]: Examining path program with hash -834003233, occurence #1 [2025-04-24 19:16:56,073 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:56,073 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:56,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2053416272, now seen corresponding path program 2 times [2025-04-24 19:16:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:56,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585648249] [2025-04-24 19:16:56,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:16:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:56,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 302 statements into 1 equivalence classes. [2025-04-24 19:16:56,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-04-24 19:16:56,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:16:56,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:16:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:16:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:16:56,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585648249] [2025-04-24 19:16:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585648249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:16:56,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:16:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:16:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588074738] [2025-04-24 19:16:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:16:56,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:16:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:16:56,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:16:56,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:16:56,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:56,268 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:16:56,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:16:56,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:56,268 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:56,269 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:58,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:16:58,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:16:58,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:16:58,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-24 19:16:58,619 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:16:58,619 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:16:58,619 INFO L139 ounterexampleChecker]: Examining path program with hash 89734749, occurence #1 [2025-04-24 19:16:58,619 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:16:58,619 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:16:58,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:16:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1569665709, now seen corresponding path program 1 times [2025-04-24 19:16:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:16:58,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372081858] [2025-04-24 19:16:58,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:16:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:16:58,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-24 19:16:58,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-24 19:16:58,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:58,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:58,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:16:58,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-24 19:16:58,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-24 19:16:58,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:16:58,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:16:58,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:16:58,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:16:58,677 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:16:58,677 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:16:58,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-24 19:16:58,678 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:16:58,679 WARN L247 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:16:58,679 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-04-24 19:16:58,705 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2025-04-24 19:16:58,708 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:58,730 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:16:58,730 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:16:58,731 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:16:58,731 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:17:01,492 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:01,493 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:01,493 INFO L139 ounterexampleChecker]: Examining path program with hash 1070350048, occurence #1 [2025-04-24 19:17:01,493 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:01,493 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:01,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 509575087, now seen corresponding path program 1 times [2025-04-24 19:17:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:01,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810596905] [2025-04-24 19:17:01,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:01,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-04-24 19:17:01,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-04-24 19:17:01,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:01,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:01,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:01,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810596905] [2025-04-24 19:17:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810596905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:01,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:17:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445408298] [2025-04-24 19:17:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:01,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:17:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:01,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:17:01,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:17:01,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:01,522 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:01,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 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) [2025-04-24 19:17:01,523 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:09,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:09,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-24 19:17:09,600 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:09,600 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:09,600 INFO L139 ounterexampleChecker]: Examining path program with hash -1781002734, occurence #1 [2025-04-24 19:17:09,600 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:09,600 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:09,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -222440905, now seen corresponding path program 1 times [2025-04-24 19:17:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:09,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580292356] [2025-04-24 19:17:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:09,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-04-24 19:17:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-04-24 19:17:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:09,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:09,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580292356] [2025-04-24 19:17:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580292356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:09,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:17:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880818224] [2025-04-24 19:17:09,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:09,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:17:09,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:09,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:17:09,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:17:09,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:09,728 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:09,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:09,728 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:09,728 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:10,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:10,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:10,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-24 19:17:10,625 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:10,625 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:10,626 INFO L139 ounterexampleChecker]: Examining path program with hash 451398991, occurence #1 [2025-04-24 19:17:10,626 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:10,626 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:10,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1612685087, now seen corresponding path program 2 times [2025-04-24 19:17:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:10,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334066878] [2025-04-24 19:17:10,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:17:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:10,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 322 statements into 1 equivalence classes. [2025-04-24 19:17:10,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-04-24 19:17:10,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:17:10,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:10,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334066878] [2025-04-24 19:17:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334066878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:17:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962111141] [2025-04-24 19:17:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:10,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:17:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:17:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:17:10,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:10,833 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:10,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:10,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:10,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:10,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:13,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:13,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:13,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:17:13,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-24 19:17:13,651 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:13,651 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:13,651 INFO L139 ounterexampleChecker]: Examining path program with hash 860223173, occurence #1 [2025-04-24 19:17:13,651 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:13,651 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:13,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash 259315947, now seen corresponding path program 1 times [2025-04-24 19:17:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:13,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787971067] [2025-04-24 19:17:13,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:13,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-24 19:17:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-24 19:17:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:17:13,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:17:13,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-24 19:17:13,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-24 19:17:13,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:13,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:17:13,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:17:13,711 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:17:13,711 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:17:13,711 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:17:13,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-24 19:17:13,713 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:17:13,713 WARN L247 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:17:13,713 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-04-24 19:17:13,745 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-24 19:17:13,748 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:17:13,771 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:17:13,771 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:17:13,772 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:17:13,773 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:17:17,015 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:17,015 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:17,015 INFO L139 ounterexampleChecker]: Examining path program with hash 815340818, occurence #1 [2025-04-24 19:17:17,015 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:17,015 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:17,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1280301578, now seen corresponding path program 1 times [2025-04-24 19:17:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:17,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840878579] [2025-04-24 19:17:17,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:17,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-24 19:17:17,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-24 19:17:17,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:17,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:17,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:17,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840878579] [2025-04-24 19:17:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840878579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:17,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:17:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830363202] [2025-04-24 19:17:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:17,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:17:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:17,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:17:17,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:17:17,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:17,044 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:17,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:17,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:25,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:25,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-24 19:17:25,671 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:25,671 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:25,671 INFO L139 ounterexampleChecker]: Examining path program with hash -1366468933, occurence #1 [2025-04-24 19:17:25,671 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:25,671 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:25,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1712913637, now seen corresponding path program 1 times [2025-04-24 19:17:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:25,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464839208] [2025-04-24 19:17:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:25,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-04-24 19:17:25,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-04-24 19:17:25,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:25,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:25,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464839208] [2025-04-24 19:17:25,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464839208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:25,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:17:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007458884] [2025-04-24 19:17:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:25,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:17:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:25,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:17:25,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:17:25,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:25,811 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:25,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:25,811 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:25,811 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:26,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:26,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:26,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-24 19:17:26,899 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:26,899 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:26,899 INFO L139 ounterexampleChecker]: Examining path program with hash -1018411281, occurence #1 [2025-04-24 19:17:26,899 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:26,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:26,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -65570779, now seen corresponding path program 2 times [2025-04-24 19:17:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:26,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581862161] [2025-04-24 19:17:26,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:17:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:26,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 342 statements into 1 equivalence classes. [2025-04-24 19:17:26,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-04-24 19:17:26,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:17:26,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:27,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581862161] [2025-04-24 19:17:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581862161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:17:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534940080] [2025-04-24 19:17:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:27,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:17:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:27,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:17:27,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:17:27,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:27,123 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:27,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:27,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:27,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:27,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:30,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:30,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:30,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:17:30,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-24 19:17:30,274 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:30,274 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:30,274 INFO L139 ounterexampleChecker]: Examining path program with hash -961416496, occurence #1 [2025-04-24 19:17:30,274 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:30,274 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:30,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash -580860480, now seen corresponding path program 1 times [2025-04-24 19:17:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:30,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248457927] [2025-04-24 19:17:30,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:30,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-04-24 19:17:30,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-04-24 19:17:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:17:30,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:17:30,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-04-24 19:17:30,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-04-24 19:17:30,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:30,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:17:30,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:17:30,344 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:17:30,344 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:17:30,344 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:17:30,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-24 19:17:30,346 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:17:30,346 WARN L247 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:17:30,346 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-04-24 19:17:30,382 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2025-04-24 19:17:30,384 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:17:30,407 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:17:30,408 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:17:30,408 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:17:30,408 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:17:33,947 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:33,947 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:33,947 INFO L139 ounterexampleChecker]: Examining path program with hash 223328380, occurence #1 [2025-04-24 19:17:33,947 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:33,947 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:33,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1572965620, now seen corresponding path program 1 times [2025-04-24 19:17:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:33,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918796353] [2025-04-24 19:17:33,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:33,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-04-24 19:17:33,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-04-24 19:17:33,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:33,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:33,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918796353] [2025-04-24 19:17:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918796353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:17:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173586804] [2025-04-24 19:17:33,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:33,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:17:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:33,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:17:33,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:17:33,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:33,977 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:33,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:33,977 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:43,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:43,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-24 19:17:43,917 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:43,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:43,918 INFO L139 ounterexampleChecker]: Examining path program with hash 2026433722, occurence #1 [2025-04-24 19:17:43,918 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:43,918 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:43,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 758038337, now seen corresponding path program 1 times [2025-04-24 19:17:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:43,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636647274] [2025-04-24 19:17:43,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:43,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-04-24 19:17:43,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-04-24 19:17:43,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:43,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:44,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636647274] [2025-04-24 19:17:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636647274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:44,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:44,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:17:44,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906769626] [2025-04-24 19:17:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:44,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:17:44,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:44,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:17:44,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:17:44,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:44,062 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:44,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:44,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:44,063 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:45,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:45,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:45,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-24 19:17:45,001 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:45,001 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:45,001 INFO L139 ounterexampleChecker]: Examining path program with hash 33598083, occurence #1 [2025-04-24 19:17:45,001 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:45,001 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:45,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:45,001 INFO L85 PathProgramCache]: Analyzing trace with hash -752686377, now seen corresponding path program 2 times [2025-04-24 19:17:45,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:45,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546279011] [2025-04-24 19:17:45,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:17:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:45,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 362 statements into 1 equivalence classes. [2025-04-24 19:17:45,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-04-24 19:17:45,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:17:45,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:45,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546279011] [2025-04-24 19:17:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546279011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:45,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:45,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:17:45,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668640998] [2025-04-24 19:17:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:45,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:17:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:45,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:17:45,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:17:45,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:45,231 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:45,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:17:45,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:45,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:45,232 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:48,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:48,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:17:48,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:17:48,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-24 19:17:48,776 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:48,776 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:48,777 INFO L139 ounterexampleChecker]: Examining path program with hash -1174024790, occurence #1 [2025-04-24 19:17:48,777 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:48,777 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:48,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:48,777 INFO L85 PathProgramCache]: Analyzing trace with hash -740106580, now seen corresponding path program 1 times [2025-04-24 19:17:48,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:48,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277942455] [2025-04-24 19:17:48,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:48,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-04-24 19:17:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-04-24 19:17:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:17:48,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:17:48,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-04-24 19:17:48,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-04-24 19:17:48,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:48,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:17:48,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:17:48,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:17:48,848 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:17:48,848 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:17:48,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-24 19:17:48,849 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:17:48,849 WARN L247 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:17:48,849 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-04-24 19:17:48,884 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-04-24 19:17:48,887 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:17:48,914 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:17:48,914 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:17:48,914 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:17:48,915 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:17:52,751 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:17:52,751 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:17:52,751 INFO L139 ounterexampleChecker]: Examining path program with hash 1096864031, occurence #1 [2025-04-24 19:17:52,751 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:17:52,751 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:17:52,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:17:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash 515074038, now seen corresponding path program 1 times [2025-04-24 19:17:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:17:52,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294795013] [2025-04-24 19:17:52,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:17:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:17:52,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-04-24 19:17:52,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-04-24 19:17:52,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:17:52,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:17:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:17:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:17:52,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294795013] [2025-04-24 19:17:52,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294795013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:17:52,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:17:52,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:17:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682562985] [2025-04-24 19:17:52,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:17:52,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:17:52,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:17:52,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:17:52,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:17:52,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:17:52,785 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:17:52,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 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) [2025-04-24 19:17:52,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:03,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:03,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-24 19:18:03,440 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:03,440 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:03,441 INFO L139 ounterexampleChecker]: Examining path program with hash -487216505, occurence #1 [2025-04-24 19:18:03,441 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:03,441 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:03,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1422412834, now seen corresponding path program 1 times [2025-04-24 19:18:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:03,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827127283] [2025-04-24 19:18:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:03,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-04-24 19:18:03,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-04-24 19:18:03,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:03,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:03,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:03,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827127283] [2025-04-24 19:18:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827127283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:03,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:03,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:18:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759828291] [2025-04-24 19:18:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:03,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:18:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:03,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:18:03,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:18:03,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:03,591 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:03,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:03,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:03,591 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:04,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:04,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:04,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-24 19:18:04,571 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:04,571 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:04,571 INFO L139 ounterexampleChecker]: Examining path program with hash -631211297, occurence #1 [2025-04-24 19:18:04,571 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:04,571 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:04,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1935289316, now seen corresponding path program 2 times [2025-04-24 19:18:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:04,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902074021] [2025-04-24 19:18:04,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:18:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:04,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 382 statements into 1 equivalence classes. [2025-04-24 19:18:04,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-04-24 19:18:04,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:18:04,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:04,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902074021] [2025-04-24 19:18:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902074021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:18:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361171880] [2025-04-24 19:18:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:04,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:18:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:04,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:18:04,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:18:04,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:04,954 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:04,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:04,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:04,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:04,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:08,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:08,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:08,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:18:08,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-24 19:18:08,886 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:08,886 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:08,886 INFO L139 ounterexampleChecker]: Examining path program with hash 1154842855, occurence #1 [2025-04-24 19:18:08,886 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:08,886 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:08,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 58813349, now seen corresponding path program 1 times [2025-04-24 19:18:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:08,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905033135] [2025-04-24 19:18:08,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:08,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-04-24 19:18:08,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-04-24 19:18:08,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:08,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:18:08,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:18:08,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-04-24 19:18:08,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-04-24 19:18:08,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:08,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:18:08,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:18:08,960 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:18:08,961 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:18:08,961 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:18:08,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-24 19:18:08,962 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:18:08,962 WARN L247 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:18:08,962 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-04-24 19:18:08,999 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-04-24 19:18:09,002 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:18:09,030 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:18:09,030 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:18:09,030 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:18:09,031 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:18:13,341 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:13,341 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:13,341 INFO L139 ounterexampleChecker]: Examining path program with hash 1822834818, occurence #1 [2025-04-24 19:18:13,341 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:13,341 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:13,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1810795347, now seen corresponding path program 1 times [2025-04-24 19:18:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:13,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100906926] [2025-04-24 19:18:13,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:13,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-04-24 19:18:13,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-04-24 19:18:13,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:13,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:13,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100906926] [2025-04-24 19:18:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100906926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:13,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:18:13,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723164008] [2025-04-24 19:18:13,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:13,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:18:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:13,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:18:13,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:18:13,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:13,374 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:13,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:13,374 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:24,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:24,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-24 19:18:24,852 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:24,852 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:24,852 INFO L139 ounterexampleChecker]: Examining path program with hash 398410344, occurence #1 [2025-04-24 19:18:24,852 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:24,852 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:24,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -26113498, now seen corresponding path program 1 times [2025-04-24 19:18:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:24,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858013728] [2025-04-24 19:18:24,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:24,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-04-24 19:18:24,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-04-24 19:18:24,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:25,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858013728] [2025-04-24 19:18:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858013728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:25,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:25,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:18:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741674228] [2025-04-24 19:18:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:25,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:18:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:25,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:18:25,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:18:25,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:25,016 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:25,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:25,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:25,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:25,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:25,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:25,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-24 19:18:25,999 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:25,999 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:26,000 INFO L139 ounterexampleChecker]: Examining path program with hash 2010522671, occurence #1 [2025-04-24 19:18:26,000 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:26,000 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:26,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash -303948262, now seen corresponding path program 2 times [2025-04-24 19:18:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:26,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834115622] [2025-04-24 19:18:26,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:18:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:26,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 1 equivalence classes. [2025-04-24 19:18:26,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-04-24 19:18:26,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:18:26,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:26,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834115622] [2025-04-24 19:18:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834115622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:26,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:26,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:18:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346955532] [2025-04-24 19:18:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:26,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:18:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:26,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:18:26,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:18:26,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:26,266 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:26,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:26,266 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:26,266 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:26,266 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:31,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:31,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:31,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:18:31,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-24 19:18:31,159 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:31,159 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:31,159 INFO L139 ounterexampleChecker]: Examining path program with hash 336197705, occurence #1 [2025-04-24 19:18:31,159 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:31,159 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:31,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2130196961, now seen corresponding path program 1 times [2025-04-24 19:18:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:31,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181373485] [2025-04-24 19:18:31,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:31,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-04-24 19:18:31,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-04-24 19:18:31,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:31,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:18:31,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:18:31,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-04-24 19:18:31,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-04-24 19:18:31,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:31,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:18:31,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:18:31,240 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:18:31,240 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:18:31,241 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:18:31,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-24 19:18:31,242 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:18:31,242 WARN L247 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:18:31,242 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-04-24 19:18:31,283 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2025-04-24 19:18:31,287 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:18:31,315 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:18:31,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:18:31,316 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:18:31,317 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:18:36,110 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:36,110 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:36,110 INFO L139 ounterexampleChecker]: Examining path program with hash -1247449224, occurence #1 [2025-04-24 19:18:36,110 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:36,110 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:36,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1822266544, now seen corresponding path program 1 times [2025-04-24 19:18:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:36,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606331067] [2025-04-24 19:18:36,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:36,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:36,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-04-24 19:18:36,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-04-24 19:18:36,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:36,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:36,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:36,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606331067] [2025-04-24 19:18:36,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606331067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:36,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:36,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:18:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819911347] [2025-04-24 19:18:36,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:36,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:18:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:36,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:18:36,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:18:36,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:36,145 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:36,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:36,145 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:48,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:48,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-24 19:18:48,911 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:48,911 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:48,911 INFO L139 ounterexampleChecker]: Examining path program with hash -222374230, occurence #1 [2025-04-24 19:18:48,911 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:48,911 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:48,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1182881816, now seen corresponding path program 1 times [2025-04-24 19:18:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:48,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894221756] [2025-04-24 19:18:48,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:48,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-04-24 19:18:48,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-04-24 19:18:48,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:48,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:49,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894221756] [2025-04-24 19:18:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894221756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:49,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:18:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463433252] [2025-04-24 19:18:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:49,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:18:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:49,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:18:49,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:18:49,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:49,152 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:49,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:49,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:49,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:50,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:50,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:50,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-24 19:18:50,205 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:50,205 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:50,205 INFO L139 ounterexampleChecker]: Examining path program with hash 322337791, occurence #1 [2025-04-24 19:18:50,205 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:50,205 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:50,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash 484040798, now seen corresponding path program 2 times [2025-04-24 19:18:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:50,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818606074] [2025-04-24 19:18:50,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:18:50,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:50,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 1 equivalence classes. [2025-04-24 19:18:50,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-04-24 19:18:50,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:18:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:18:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:18:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:18:50,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818606074] [2025-04-24 19:18:50,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818606074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:18:50,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:18:50,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:18:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626448779] [2025-04-24 19:18:50,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:18:50,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:18:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:18:50,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:18:50,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:18:50,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:50,494 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:18:50,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:18:50,494 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:50,494 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:50,494 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:55,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:18:55,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:18:55,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:18:55,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-24 19:18:55,335 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:18:55,335 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:18:55,335 INFO L139 ounterexampleChecker]: Examining path program with hash -1448047522, occurence #1 [2025-04-24 19:18:55,335 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:18:55,335 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:18:55,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:18:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1073281603, now seen corresponding path program 1 times [2025-04-24 19:18:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:18:55,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813993484] [2025-04-24 19:18:55,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:18:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:18:55,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-04-24 19:18:55,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-04-24 19:18:55,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:55,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:18:55,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:18:55,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-04-24 19:18:55,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-04-24 19:18:55,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:18:55,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:18:55,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:18:55,419 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:18:55,419 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:18:55,419 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:18:55,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-24 19:18:55,421 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:18:55,421 WARN L247 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:18:55,421 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-04-24 19:18:55,463 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2025-04-24 19:18:55,466 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:18:55,496 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:18:55,497 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:18:55,497 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:18:55,497 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:19:00,598 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:00,599 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:00,599 INFO L139 ounterexampleChecker]: Examining path program with hash 1137294388, occurence #1 [2025-04-24 19:19:00,599 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:00,599 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:00,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1289317526, now seen corresponding path program 1 times [2025-04-24 19:19:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:00,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471939670] [2025-04-24 19:19:00,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:00,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-04-24 19:19:00,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-04-24 19:19:00,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:00,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:00,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471939670] [2025-04-24 19:19:00,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471939670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:00,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:19:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491022552] [2025-04-24 19:19:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:00,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:19:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:00,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:19:00,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:19:00,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:00,637 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:00,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:00,637 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:14,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:14,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-24 19:19:14,682 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:14,682 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:14,683 INFO L139 ounterexampleChecker]: Examining path program with hash 1623931484, occurence #1 [2025-04-24 19:19:14,683 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:14,683 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:14,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 671536857, now seen corresponding path program 1 times [2025-04-24 19:19:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:14,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293520330] [2025-04-24 19:19:14,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:14,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-04-24 19:19:14,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-04-24 19:19:14,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:14,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:14,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293520330] [2025-04-24 19:19:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293520330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:19:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58981181] [2025-04-24 19:19:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:14,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:19:14,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:14,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:19:14,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:19:14,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:14,874 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:14,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:14,874 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:14,874 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:15,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:15,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:19:15,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-24 19:19:15,961 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:15,961 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:15,962 INFO L139 ounterexampleChecker]: Examining path program with hash 590054988, occurence #1 [2025-04-24 19:19:15,962 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:15,962 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:15,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:15,962 INFO L85 PathProgramCache]: Analyzing trace with hash -505924239, now seen corresponding path program 2 times [2025-04-24 19:19:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:15,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699583732] [2025-04-24 19:19:15,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:19:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:15,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 442 statements into 1 equivalence classes. [2025-04-24 19:19:16,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-04-24 19:19:16,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:19:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:16,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:16,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699583732] [2025-04-24 19:19:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699583732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:19:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998483618] [2025-04-24 19:19:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:16,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:19:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:16,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:19:16,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:19:16,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:16,365 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:16,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:16,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:16,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:19:16,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:21,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:21,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:19:21,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:19:21,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-24 19:19:21,897 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:21,898 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:21,898 INFO L139 ounterexampleChecker]: Examining path program with hash -1509766960, occurence #1 [2025-04-24 19:19:21,898 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:21,898 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:21,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1582580372, now seen corresponding path program 1 times [2025-04-24 19:19:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:21,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159597096] [2025-04-24 19:19:21,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:21,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-04-24 19:19:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-04-24 19:19:21,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:21,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:19:21,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:19:21,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-04-24 19:19:21,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-04-24 19:19:21,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:21,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:19:21,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:19:21,986 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:19:21,986 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:19:21,986 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:19:21,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-24 19:19:21,987 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:19:21,988 WARN L247 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:19:21,988 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-04-24 19:19:22,029 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2025-04-24 19:19:22,032 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:19:22,065 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:19:22,065 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:19:22,065 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:19:22,066 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:19:27,674 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:27,674 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:27,674 INFO L139 ounterexampleChecker]: Examining path program with hash 509503913, occurence #1 [2025-04-24 19:19:27,674 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:27,674 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:27,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -504724318, now seen corresponding path program 1 times [2025-04-24 19:19:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:27,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009755072] [2025-04-24 19:19:27,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:27,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-04-24 19:19:27,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-04-24 19:19:27,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:27,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:27,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009755072] [2025-04-24 19:19:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009755072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:19:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716379161] [2025-04-24 19:19:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:27,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:19:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:27,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:19:27,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:19:27,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:27,713 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:27,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:27,713 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:42,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:42,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-24 19:19:42,561 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:42,561 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:42,562 INFO L139 ounterexampleChecker]: Examining path program with hash 725541108, occurence #1 [2025-04-24 19:19:42,562 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:42,562 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:42,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1644557181, now seen corresponding path program 1 times [2025-04-24 19:19:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:42,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171852235] [2025-04-24 19:19:42,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:42,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-04-24 19:19:42,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-04-24 19:19:42,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:42,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:42,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171852235] [2025-04-24 19:19:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171852235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:42,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:19:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470380164] [2025-04-24 19:19:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:42,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:19:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:42,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:19:42,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:19:42,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:42,755 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:42,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:42,755 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:43,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:43,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:19:43,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-24 19:19:43,834 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:43,834 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:43,835 INFO L139 ounterexampleChecker]: Examining path program with hash 862424428, occurence #1 [2025-04-24 19:19:43,835 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:43,835 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:43,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 858294999, now seen corresponding path program 2 times [2025-04-24 19:19:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:43,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394451761] [2025-04-24 19:19:43,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:19:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:43,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 462 statements into 1 equivalence classes. [2025-04-24 19:19:43,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-04-24 19:19:43,889 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:19:43,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:44,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:44,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394451761] [2025-04-24 19:19:44,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394451761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:44,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:44,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:19:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492416178] [2025-04-24 19:19:44,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:44,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:19:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:44,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:19:44,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:19:44,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:44,258 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:44,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:44,258 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:44,258 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:19:44,258 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:50,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:50,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:19:50,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:19:50,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-24 19:19:50,312 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:50,313 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:50,313 INFO L139 ounterexampleChecker]: Examining path program with hash 547777475, occurence #1 [2025-04-24 19:19:50,313 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:50,313 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:50,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1905115785, now seen corresponding path program 1 times [2025-04-24 19:19:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:50,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390270967] [2025-04-24 19:19:50,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:50,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:50,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-24 19:19:50,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-24 19:19:50,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:50,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:19:50,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:19:50,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-24 19:19:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-24 19:19:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:19:50,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:19:50,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:19:50,410 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:19:50,410 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:19:50,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-24 19:19:50,411 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:19:50,412 WARN L247 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:19:50,412 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-04-24 19:19:50,451 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2025-04-24 19:19:50,454 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:19:50,487 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:19:50,487 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:19:50,487 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:19:50,487 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:19:56,570 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:19:56,570 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:19:56,571 INFO L139 ounterexampleChecker]: Examining path program with hash -901451212, occurence #1 [2025-04-24 19:19:56,571 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:19:56,571 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:19:56,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:19:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash -824558373, now seen corresponding path program 1 times [2025-04-24 19:19:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:19:56,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850141152] [2025-04-24 19:19:56,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:19:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:19:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-04-24 19:19:56,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-24 19:19:56,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:19:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:19:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:19:56,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:19:56,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850141152] [2025-04-24 19:19:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850141152] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:19:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:19:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:19:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534102309] [2025-04-24 19:19:56,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:19:56,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:19:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:19:56,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:19:56,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:19:56,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:19:56,612 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:19:56,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:19:56,612 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:12,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:12,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-24 19:20:12,639 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:12,639 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:12,640 INFO L139 ounterexampleChecker]: Examining path program with hash -1443793411, occurence #1 [2025-04-24 19:20:12,640 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:12,640 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:12,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash 560421081, now seen corresponding path program 1 times [2025-04-24 19:20:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:12,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008634585] [2025-04-24 19:20:12,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:20:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:12,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-04-24 19:20:12,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-04-24 19:20:12,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:12,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:20:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:20:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:20:12,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008634585] [2025-04-24 19:20:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008634585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:20:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:20:12,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:20:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638763749] [2025-04-24 19:20:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:20:12,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:20:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:20:12,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:20:12,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:20:12,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:12,976 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:20:12,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:20:12,976 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:12,976 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:14,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:14,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:20:14,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-24 19:20:14,018 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:14,019 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:14,019 INFO L139 ounterexampleChecker]: Examining path program with hash -2100187699, occurence #1 [2025-04-24 19:20:14,019 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:14,019 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:14,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash -766128819, now seen corresponding path program 2 times [2025-04-24 19:20:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:14,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108460242] [2025-04-24 19:20:14,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:20:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:14,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 482 statements into 1 equivalence classes. [2025-04-24 19:20:14,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-04-24 19:20:14,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:20:14,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:20:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:20:14,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:20:14,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108460242] [2025-04-24 19:20:14,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108460242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:20:14,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:20:14,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:20:14,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692493015] [2025-04-24 19:20:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:20:14,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:20:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:20:14,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:20:14,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:20:14,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:14,338 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:20:14,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:20:14,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:14,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:20:14,338 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:20,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:20,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:20:20,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:20:20,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-24 19:20:20,614 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:20,614 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:20,614 INFO L139 ounterexampleChecker]: Examining path program with hash -2135987127, occurence #1 [2025-04-24 19:20:20,614 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:20,614 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:20,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1981060132, now seen corresponding path program 1 times [2025-04-24 19:20:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:20,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656617016] [2025-04-24 19:20:20,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:20:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-24 19:20:20,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-24 19:20:20,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:20,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:20:20,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:20:20,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-24 19:20:20,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-24 19:20:20,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:20,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:20:20,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:20:20,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:20:20,726 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:20:20,726 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:20:20,727 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-24 19:20:20,729 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:20:20,729 WARN L247 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:20:20,729 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-04-24 19:20:20,773 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2025-04-24 19:20:20,777 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:20:20,813 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:20:20,813 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:20:20,814 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:20:20,814 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:20:27,362 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:27,362 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:27,363 INFO L139 ounterexampleChecker]: Examining path program with hash -1785145810, occurence #1 [2025-04-24 19:20:27,363 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:27,363 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:27,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1658934918, now seen corresponding path program 1 times [2025-04-24 19:20:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:27,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556646736] [2025-04-24 19:20:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:20:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:27,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-04-24 19:20:27,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-04-24 19:20:27,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:27,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:20:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:20:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:20:27,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556646736] [2025-04-24 19:20:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556646736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:20:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:20:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:20:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943917148] [2025-04-24 19:20:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:20:27,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:20:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:20:27,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:20:27,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:20:27,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:27,405 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:20:27,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:20:27,405 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:44,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:44,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-24 19:20:44,805 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:44,805 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:44,806 INFO L139 ounterexampleChecker]: Examining path program with hash 1416905285, occurence #1 [2025-04-24 19:20:44,806 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:44,806 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:44,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1242057446, now seen corresponding path program 1 times [2025-04-24 19:20:44,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:44,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886675834] [2025-04-24 19:20:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:20:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:44,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-04-24 19:20:44,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-04-24 19:20:44,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:20:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:20:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:20:45,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886675834] [2025-04-24 19:20:45,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886675834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:20:45,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:20:45,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:20:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449424262] [2025-04-24 19:20:45,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:20:45,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:20:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:20:45,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:20:45,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:20:45,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:45,021 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:20:45,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:20:45,021 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:45,021 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:46,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:46,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:20:46,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-24 19:20:46,133 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:46,133 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:46,134 INFO L139 ounterexampleChecker]: Examining path program with hash -733253287, occurence #1 [2025-04-24 19:20:46,134 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:46,134 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:46,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1763836230, now seen corresponding path program 2 times [2025-04-24 19:20:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:46,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544302949] [2025-04-24 19:20:46,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:20:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:46,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 502 statements into 1 equivalence classes. [2025-04-24 19:20:46,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-04-24 19:20:46,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:20:46,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:20:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:20:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:20:46,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544302949] [2025-04-24 19:20:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544302949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:20:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:20:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:20:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414112966] [2025-04-24 19:20:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:20:46,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:20:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:20:46,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:20:46,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:20:46,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:46,581 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:20:46,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:20:46,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:46,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:20:46,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:53,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:20:53,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:20:53,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:20:53,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-24 19:20:53,635 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:20:53,635 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:20:53,635 INFO L139 ounterexampleChecker]: Examining path program with hash -1124636977, occurence #1 [2025-04-24 19:20:53,635 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:20:53,635 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:20:53,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:20:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1284660936, now seen corresponding path program 1 times [2025-04-24 19:20:53,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:20:53,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562869433] [2025-04-24 19:20:53,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:20:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:20:53,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-04-24 19:20:53,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-04-24 19:20:53,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:53,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:20:53,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:20:53,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-04-24 19:20:53,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-04-24 19:20:53,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:20:53,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:20:53,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:20:53,742 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:20:53,742 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:20:53,742 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:20:53,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-24 19:20:53,744 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:20:53,744 WARN L247 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:20:53,744 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-04-24 19:20:53,788 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2025-04-24 19:20:53,792 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:20:53,826 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:20:53,826 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:20:53,826 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:20:53,826 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:21:00,901 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:00,901 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:00,902 INFO L139 ounterexampleChecker]: Examining path program with hash 1764368641, occurence #1 [2025-04-24 19:21:00,902 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:00,902 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:00,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 61078420, now seen corresponding path program 1 times [2025-04-24 19:21:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:00,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967750459] [2025-04-24 19:21:00,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:21:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:00,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-04-24 19:21:00,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-04-24 19:21:00,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:21:00,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:21:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:21:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:21:00,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967750459] [2025-04-24 19:21:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967750459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:21:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:21:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:21:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724484134] [2025-04-24 19:21:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:21:00,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:21:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:21:00,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:21:00,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:21:00,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:00,947 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:21:00,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:21:00,947 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:19,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:19,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-24 19:21:19,684 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:19,684 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:19,684 INFO L139 ounterexampleChecker]: Examining path program with hash 2111212610, occurence #1 [2025-04-24 19:21:19,684 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:19,684 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:19,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 335084882, now seen corresponding path program 1 times [2025-04-24 19:21:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:19,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391300735] [2025-04-24 19:21:19,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:21:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:19,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-04-24 19:21:19,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-04-24 19:21:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:21:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:21:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:21:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:21:20,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391300735] [2025-04-24 19:21:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391300735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:21:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:21:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:21:20,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623616276] [2025-04-24 19:21:20,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:21:20,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:21:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:21:20,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:21:20,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:21:20,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:20,042 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:21:20,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:21:20,042 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:20,042 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:21,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:21,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:21:21,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-24 19:21:21,291 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:21,291 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:21,291 INFO L139 ounterexampleChecker]: Examining path program with hash -290794232, occurence #1 [2025-04-24 19:21:21,291 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:21,291 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:21,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:21,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1233544462, now seen corresponding path program 2 times [2025-04-24 19:21:21,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:21,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029910097] [2025-04-24 19:21:21,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:21:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:21,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 522 statements into 1 equivalence classes. [2025-04-24 19:21:21,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-04-24 19:21:21,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:21:21,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:21:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:21:21,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:21:21,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029910097] [2025-04-24 19:21:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029910097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:21:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:21:21,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:21:21,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219597301] [2025-04-24 19:21:21,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:21:21,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:21:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:21:21,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:21:21,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:21:21,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:21,642 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:21:21,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:21:21,642 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:21,642 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:21:21,642 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:29,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:29,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:21:29,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:21:29,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-24 19:21:29,283 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:29,283 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:29,283 INFO L139 ounterexampleChecker]: Examining path program with hash -1028681401, occurence #1 [2025-04-24 19:21:29,283 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:29,283 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:29,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1235440968, now seen corresponding path program 1 times [2025-04-24 19:21:29,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:29,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142640477] [2025-04-24 19:21:29,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:21:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:29,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-04-24 19:21:29,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-04-24 19:21:29,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:21:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:21:29,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:21:29,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-04-24 19:21:29,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-04-24 19:21:29,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:21:29,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:21:29,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:21:29,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:21:29,398 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:21:29,398 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:21:29,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-24 19:21:29,400 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:21:29,400 WARN L247 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:21:29,400 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-04-24 19:21:29,449 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2025-04-24 19:21:29,453 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:21:29,490 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:21:29,491 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:21:29,492 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:21:29,492 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:21:37,670 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:37,670 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:37,670 INFO L139 ounterexampleChecker]: Examining path program with hash 223816478, occurence #1 [2025-04-24 19:21:37,670 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:37,670 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:37,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 810946788, now seen corresponding path program 1 times [2025-04-24 19:21:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:37,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261506782] [2025-04-24 19:21:37,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:21:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:37,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-04-24 19:21:37,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-04-24 19:21:37,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:21:37,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:21:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:21:37,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:21:37,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261506782] [2025-04-24 19:21:37,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261506782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:21:37,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:21:37,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:21:37,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242106855] [2025-04-24 19:21:37,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:21:37,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:21:37,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:21:37,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:21:37,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:21:37,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:37,718 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:21:37,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:21:37,718 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:58,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:58,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-24 19:21:58,243 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:58,243 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:58,243 INFO L139 ounterexampleChecker]: Examining path program with hash 378683016, occurence #1 [2025-04-24 19:21:58,244 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:58,244 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:58,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 823240753, now seen corresponding path program 1 times [2025-04-24 19:21:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:58,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404357264] [2025-04-24 19:21:58,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:21:58,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:58,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-04-24 19:21:58,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-04-24 19:21:58,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:21:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:21:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:21:58,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:21:58,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404357264] [2025-04-24 19:21:58,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404357264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:21:58,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:21:58,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:21:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701842070] [2025-04-24 19:21:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:21:58,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:21:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:21:58,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:21:58,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:21:58,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:58,479 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:21:58,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:21:58,480 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:58,480 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:59,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:21:59,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:21:59,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-24 19:21:59,647 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:21:59,647 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:21:59,647 INFO L139 ounterexampleChecker]: Examining path program with hash -1596730041, occurence #1 [2025-04-24 19:21:59,647 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:21:59,647 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:21:59,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:21:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1191340319, now seen corresponding path program 2 times [2025-04-24 19:21:59,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:21:59,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747874923] [2025-04-24 19:21:59,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:21:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:21:59,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 542 statements into 1 equivalence classes. [2025-04-24 19:21:59,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-04-24 19:21:59,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:21:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:22:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:22:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:22:00,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747874923] [2025-04-24 19:22:00,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747874923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:22:00,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:22:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:22:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412020977] [2025-04-24 19:22:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:22:00,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:22:00,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:22:00,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:22:00,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:22:00,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:00,015 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:22:00,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:22:00,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:00,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:22:00,016 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:08,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:08,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:22:08,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:22:08,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-24 19:22:08,699 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:22:08,699 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:22:08,700 INFO L139 ounterexampleChecker]: Examining path program with hash -623842813, occurence #1 [2025-04-24 19:22:08,700 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:22:08,700 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:22:08,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:22:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1395409210, now seen corresponding path program 1 times [2025-04-24 19:22:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:22:08,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560032300] [2025-04-24 19:22:08,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:22:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:22:08,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-04-24 19:22:08,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-04-24 19:22:08,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:22:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:22:08,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:22:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-04-24 19:22:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-04-24 19:22:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:22:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:22:08,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:22:08,825 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:22:08,825 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:22:08,826 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:22:08,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-24 19:22:08,828 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:22:08,828 WARN L247 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:22:08,828 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-04-24 19:22:08,878 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2025-04-24 19:22:08,881 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:22:08,920 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:22:08,920 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:22:08,921 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:22:08,921 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:22:17,565 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:22:17,565 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:22:17,566 INFO L139 ounterexampleChecker]: Examining path program with hash -1883823713, occurence #1 [2025-04-24 19:22:17,566 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:22:17,566 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:22:17,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:22:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 858456989, now seen corresponding path program 1 times [2025-04-24 19:22:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:22:17,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241347671] [2025-04-24 19:22:17,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:22:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:22:17,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-04-24 19:22:17,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-04-24 19:22:17,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:22:17,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:22:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:22:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:22:17,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241347671] [2025-04-24 19:22:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241347671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:22:17,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:22:17,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:22:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719149663] [2025-04-24 19:22:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:22:17,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:22:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:22:17,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:22:17,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:22:17,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:17,615 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:22:17,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:22:17,616 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:39,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:39,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-24 19:22:39,879 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:22:39,879 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:22:39,879 INFO L139 ounterexampleChecker]: Examining path program with hash -1223001954, occurence #1 [2025-04-24 19:22:39,879 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:22:39,879 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:22:39,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:22:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -177343475, now seen corresponding path program 1 times [2025-04-24 19:22:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:22:39,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093169025] [2025-04-24 19:22:39,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:22:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:22:39,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-04-24 19:22:39,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-04-24 19:22:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:22:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:22:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:22:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:22:40,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093169025] [2025-04-24 19:22:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093169025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:22:40,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:22:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:22:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601297675] [2025-04-24 19:22:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:22:40,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:22:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:22:40,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:22:40,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:22:40,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:40,136 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:22:40,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:22:40,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:40,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:41,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:41,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:22:41,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-24 19:22:41,534 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:22:41,534 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:22:41,534 INFO L139 ounterexampleChecker]: Examining path program with hash 857582415, occurence #1 [2025-04-24 19:22:41,534 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:22:41,534 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:22:41,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:22:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 166868151, now seen corresponding path program 2 times [2025-04-24 19:22:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:22:41,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276930639] [2025-04-24 19:22:41,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:22:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:22:41,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 562 statements into 1 equivalence classes. [2025-04-24 19:22:41,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-04-24 19:22:41,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:22:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:22:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:22:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:22:41,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276930639] [2025-04-24 19:22:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276930639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:22:41,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:22:41,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:22:41,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339230229] [2025-04-24 19:22:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:22:41,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:22:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:22:41,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:22:41,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:22:41,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:41,933 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:22:41,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:22:41,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:41,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:22:41,934 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:51,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:22:51,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:22:51,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:22:51,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-24 19:22:51,687 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:22:51,687 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:22:51,687 INFO L139 ounterexampleChecker]: Examining path program with hash -1113352712, occurence #1 [2025-04-24 19:22:51,687 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:22:51,687 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:22:51,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:22:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash -749794879, now seen corresponding path program 1 times [2025-04-24 19:22:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:22:51,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584472399] [2025-04-24 19:22:51,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:22:51,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:22:51,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-04-24 19:22:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-04-24 19:22:51,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:22:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:22:51,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:22:51,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-04-24 19:22:51,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-04-24 19:22:51,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:22:51,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:22:51,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:22:51,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:22:51,821 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:22:51,821 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:22:51,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-24 19:22:51,823 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:22:51,823 WARN L247 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:22:51,823 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-04-24 19:22:51,881 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2025-04-24 19:22:51,885 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:22:51,920 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:22:51,920 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:22:51,921 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:22:51,921 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:23:00,728 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:23:00,728 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:23:00,728 INFO L139 ounterexampleChecker]: Examining path program with hash -1758096023, occurence #1 [2025-04-24 19:23:00,728 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:23:00,728 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:23:00,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:23:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1370311030, now seen corresponding path program 1 times [2025-04-24 19:23:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:23:00,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931059843] [2025-04-24 19:23:00,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:23:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:23:00,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-04-24 19:23:00,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-04-24 19:23:00,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:23:00,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:23:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:23:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:23:00,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931059843] [2025-04-24 19:23:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931059843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:23:00,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:23:00,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:23:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284955491] [2025-04-24 19:23:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:23:00,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:23:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:23:00,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:23:00,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:23:00,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:00,780 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:23:00,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:23:00,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:25,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:25,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-24 19:23:25,414 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:23:25,414 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:23:25,415 INFO L139 ounterexampleChecker]: Examining path program with hash -303822518, occurence #1 [2025-04-24 19:23:25,415 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:23:25,415 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:23:25,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:23:25,415 INFO L85 PathProgramCache]: Analyzing trace with hash -105110219, now seen corresponding path program 1 times [2025-04-24 19:23:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:23:25,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273198531] [2025-04-24 19:23:25,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:23:25,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:23:25,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-04-24 19:23:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-04-24 19:23:25,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:23:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:23:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:23:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:23:25,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273198531] [2025-04-24 19:23:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273198531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:23:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:23:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:23:25,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806534987] [2025-04-24 19:23:25,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:23:25,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 19:23:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:23:25,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 19:23:25,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 19:23:25,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:25,672 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:23:25,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:23:25,672 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:25,672 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:26,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:26,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:23:26,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-24 19:23:26,997 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:23:26,997 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:23:26,998 INFO L139 ounterexampleChecker]: Examining path program with hash -1366352157, occurence #1 [2025-04-24 19:23:26,998 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:23:26,998 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:23:26,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:23:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 184459101, now seen corresponding path program 2 times [2025-04-24 19:23:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:23:26,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291995931] [2025-04-24 19:23:26,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 19:23:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:23:27,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 582 statements into 1 equivalence classes. [2025-04-24 19:23:27,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-04-24 19:23:27,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 19:23:27,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:23:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:23:27,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:23:27,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291995931] [2025-04-24 19:23:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291995931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:23:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:23:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 19:23:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081068933] [2025-04-24 19:23:27,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:23:27,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 19:23:27,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:23:27,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 19:23:27,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 19:23:27,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:27,535 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:23:27,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:23:27,535 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:27,535 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:23:27,535 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:37,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:37,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 19:23:37,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 19:23:37,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-24 19:23:37,231 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:23:37,231 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:23:37,231 INFO L139 ounterexampleChecker]: Examining path program with hash -1373753731, occurence #1 [2025-04-24 19:23:37,231 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:23:37,231 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:23:37,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:23:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -230113398, now seen corresponding path program 1 times [2025-04-24 19:23:37,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:23:37,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262122550] [2025-04-24 19:23:37,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:23:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:23:37,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-04-24 19:23:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-04-24 19:23:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:23:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:23:37,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 19:23:37,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-04-24 19:23:37,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-04-24 19:23:37,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:23:37,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 19:23:37,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 19:23:37,374 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 19:23:37,374 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 19:23:37,374 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 19:23:37,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-24 19:23:37,377 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-24 19:23:37,378 WARN L247 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 19:23:37,378 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-04-24 19:23:37,432 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2025-04-24 19:23:37,435 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:23:37,479 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 19:23:37,480 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 19:23:37,480 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c679604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 19:23:37,480 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 19:23:46,681 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 19:23:46,681 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 19:23:46,682 INFO L139 ounterexampleChecker]: Examining path program with hash -671678738, occurence #1 [2025-04-24 19:23:46,682 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 19:23:46,682 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 19:23:46,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 19:23:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1054236270, now seen corresponding path program 1 times [2025-04-24 19:23:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 19:23:46,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314712550] [2025-04-24 19:23:46,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 19:23:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 19:23:46,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-04-24 19:23:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-04-24 19:23:46,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 19:23:46,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 19:23:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 19:23:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 19:23:46,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314712550] [2025-04-24 19:23:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314712550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 19:23:46,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 19:23:46,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 19:23:46,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265428571] [2025-04-24 19:23:46,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 19:23:46,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 19:23:46,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 19:23:46,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 19:23:46,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 19:23:46,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 19:23:46,919 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 19:23:46,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 19:23:46,919 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.