./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 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_11-ptr_racing.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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 01:26:16,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 01:26:16,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 01:26:16,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 01:26:16,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 01:26:16,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 01:26:16,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 01:26:16,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 01:26:16,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 01:26:16,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 01:26:16,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 01:26:16,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 01:26:16,816 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 01:26:16,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 01:26:16,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 01:26:16,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 01:26:16,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 01:26:16,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 01:26:16,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 01:26:16,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 01:26:16,819 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 01:26:16,819 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 01:26:17,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 01:26:17,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 01:26:17,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 01:26:17,042 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 01:26:17,043 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 01:26:17,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-03-20 01:26:18,266 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6629aa55/5e5afd0d59f04b7aa70cd859eea0a6b0/FLAG61d6e8001 [2025-03-20 01:26:18,439 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 01:26:18,440 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-03-20 01:26:18,450 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6629aa55/5e5afd0d59f04b7aa70cd859eea0a6b0/FLAG61d6e8001 [2025-03-20 01:26:19,267 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6629aa55/5e5afd0d59f04b7aa70cd859eea0a6b0 [2025-03-20 01:26:19,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 01:26:19,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 01:26:19,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 01:26:19,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 01:26:19,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 01:26:19,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282899ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19, skipping insertion in model container [2025-03-20 01:26:19,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 01:26:19,504 WARN L250 ndardFunctionHandler]: 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_11-ptr_racing.i[30176,30189] [2025-03-20 01:26:19,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 01:26:19,545 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 01:26:19,587 WARN L250 ndardFunctionHandler]: 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_11-ptr_racing.i[30176,30189] [2025-03-20 01:26:19,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 01:26:19,628 INFO L204 MainTranslator]: Completed translation [2025-03-20 01:26:19,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19 WrapperNode [2025-03-20 01:26:19,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 01:26:19,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 01:26:19,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 01:26:19,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 01:26:19,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,650 INFO L138 Inliner]: procedures = 171, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2025-03-20 01:26:19,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 01:26:19,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 01:26:19,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 01:26:19,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 01:26:19,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 01:26:19,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 01:26:19,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 01:26:19,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 01:26:19,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (1/1) ... [2025-03-20 01:26:19,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 01:26:19,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:26:19,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 01:26:19,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-20 01:26:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-20 01:26:19,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 01:26:19,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 01:26:19,706 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 01:26:19,783 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 01:26:19,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 01:26:19,954 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 01:26:19,954 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 01:26:20,053 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 01:26:20,053 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-20 01:26:20,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:26:20 BoogieIcfgContainer [2025-03-20 01:26:20,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 01:26:20,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 01:26:20,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 01:26:20,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 01:26:20,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 01:26:19" (1/3) ... [2025-03-20 01:26:20,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36406532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:26:20, skipping insertion in model container [2025-03-20 01:26:20,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 01:26:19" (2/3) ... [2025-03-20 01:26:20,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36406532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 01:26:20, skipping insertion in model container [2025-03-20 01:26:20,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 01:26:20" (3/3) ... [2025-03-20 01:26:20,060 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-03-20 01:26:20,068 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 01:26:20,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 39 locations, 48 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-20 01:26:20,070 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 01:26:20,092 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-20 01:26:20,136 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:20,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 01:26:20,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 01:26:20,138 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-03-20 01:26:20,139 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-03-20 01:26:20,186 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:20,191 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:20,196 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:20,196 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:20,334 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:20,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:20,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1693036735, now seen corresponding path program 1 times [2025-03-20 01:26:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905688998] [2025-03-20 01:26:20,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:20,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-20 01:26:20,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-20 01:26:20,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:20,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:20,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:20,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-20 01:26:20,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-20 01:26:20,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:20,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:20,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:20,469 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:20,469 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:20,470 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:20,471 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 01:26:20,475 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-20 01:26:20,477 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:20,477 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-20 01:26:20,494 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 01:26:20,496 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:20,501 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:20,502 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:20,502 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:20,502 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:20,763 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:20,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash 344333542, now seen corresponding path program 1 times [2025-03-20 01:26:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896839439] [2025-03-20 01:26:20,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:20,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-20 01:26:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-20 01:26:20,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:20,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896839439] [2025-03-20 01:26:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896839439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684621313] [2025-03-20 01:26:20,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:20,844 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:20,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:20,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:20,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:20,868 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:20,869 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-03-20 01:26:20,869 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:20,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:20,969 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-20 01:26:20,969 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:20,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash 178849573, now seen corresponding path program 1 times [2025-03-20 01:26:20,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:20,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553861954] [2025-03-20 01:26:20,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:20,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:20,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-20 01:26:20,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-20 01:26:20,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:20,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553861954] [2025-03-20 01:26:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553861954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:21,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673841632] [2025-03-20 01:26:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:21,132 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:21,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:21,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:21,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:21,132 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:21,133 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-03-20 01:26:21,133 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:21,133 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:21,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:21,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:21,184 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-20 01:26:21,184 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:21,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -911546172, now seen corresponding path program 1 times [2025-03-20 01:26:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309318339] [2025-03-20 01:26:21,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:21,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-20 01:26:21,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-20 01:26:21,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:21,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:21,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:21,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-20 01:26:21,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-20 01:26:21,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:21,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:21,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:21,217 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:21,217 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:21,217 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:21,217 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-20 01:26:21,218 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-20 01:26:21,218 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:21,218 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-20 01:26:21,243 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-20 01:26:21,246 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:21,253 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:21,253 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:21,254 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:21,254 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:21,707 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:21,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash 60205608, now seen corresponding path program 1 times [2025-03-20 01:26:21,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966992569] [2025-03-20 01:26:21,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:21,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:21,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-20 01:26:21,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-20 01:26:21,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:21,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:21,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:21,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966992569] [2025-03-20 01:26:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966992569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:21,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:21,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004930710] [2025-03-20 01:26:21,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:21,743 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:21,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:21,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:21,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:21,743 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:21,743 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 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-03-20 01:26:21,743 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,097 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-20 01:26:22,097 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:22,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1985860274, now seen corresponding path program 1 times [2025-03-20 01:26:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789918236] [2025-03-20 01:26:22,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-20 01:26:22,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-20 01:26:22,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:22,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:22,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789918236] [2025-03-20 01:26:22,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789918236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:22,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:22,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:22,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752589660] [2025-03-20 01:26:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:22,208 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:22,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:22,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:22,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,209 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:22,209 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-03-20 01:26:22,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,210 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:22,322 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-20 01:26:22,322 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:22,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:22,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1593350865, now seen corresponding path program 1 times [2025-03-20 01:26:22,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:22,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106826714] [2025-03-20 01:26:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-20 01:26:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-20 01:26:22,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:22,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106826714] [2025-03-20 01:26:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106826714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:22,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:22,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:22,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755764025] [2025-03-20 01:26:22,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:22,503 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:22,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:22,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:22,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,504 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:22,504 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:22,504 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,504 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:22,504 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:22,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:22,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:22,546 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-20 01:26:22,546 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:22,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash 405065840, now seen corresponding path program 1 times [2025-03-20 01:26:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363286490] [2025-03-20 01:26:22,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:22,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-20 01:26:22,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-20 01:26:22,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:22,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:22,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:22,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-20 01:26:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-20 01:26:22,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:22,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:22,581 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:22,581 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:22,582 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:22,582 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-20 01:26:22,583 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:22,583 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:22,583 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-20 01:26:22,604 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-20 01:26:22,607 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:22,620 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:22,620 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:22,621 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:22,621 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:23,156 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:23,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1333747229, now seen corresponding path program 1 times [2025-03-20 01:26:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:23,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583706673] [2025-03-20 01:26:23,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:23,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-20 01:26:23,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-20 01:26:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583706673] [2025-03-20 01:26:23,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583706673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:23,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:23,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:23,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63398594] [2025-03-20 01:26:23,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:23,187 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:23,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:23,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:23,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:23,188 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:23,188 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-03-20 01:26:23,188 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:23,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:23,868 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-20 01:26:23,868 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:23,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1664926832, now seen corresponding path program 1 times [2025-03-20 01:26:23,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:23,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646223199] [2025-03-20 01:26:23,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:23,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:23,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-20 01:26:23,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-20 01:26:23,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:23,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:23,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646223199] [2025-03-20 01:26:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646223199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803219757] [2025-03-20 01:26:23,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:23,956 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:23,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:23,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:23,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:23,957 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:23,957 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:23,957 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:23,957 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:24,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:24,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:24,145 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-20 01:26:24,145 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:24,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash -872918054, now seen corresponding path program 1 times [2025-03-20 01:26:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:24,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095186189] [2025-03-20 01:26:24,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:24,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:24,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-20 01:26:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-20 01:26:24,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:24,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:24,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095186189] [2025-03-20 01:26:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095186189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:24,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:24,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100322469] [2025-03-20 01:26:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:24,308 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:24,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:24,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:24,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:24,309 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:24,309 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-03-20 01:26:24,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:24,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:24,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:24,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:24,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:24,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:24,364 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-20 01:26:24,364 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:24,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1263314050, now seen corresponding path program 1 times [2025-03-20 01:26:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018273723] [2025-03-20 01:26:24,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:24,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-20 01:26:24,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-20 01:26:24,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:24,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:24,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:24,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-20 01:26:24,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-20 01:26:24,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:24,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:24,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:24,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:24,408 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:24,408 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:24,408 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-20 01:26:24,410 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:24,411 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:24,411 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-20 01:26:24,432 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-20 01:26:24,435 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:24,449 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:24,450 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:24,450 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:24,450 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:25,102 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:25,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -724124691, now seen corresponding path program 1 times [2025-03-20 01:26:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700265424] [2025-03-20 01:26:25,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:25,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-20 01:26:25,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 01:26:25,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:25,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-03-20 01:26:25,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:25,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700265424] [2025-03-20 01:26:25,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700265424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:25,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:25,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651389316] [2025-03-20 01:26:25,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:25,125 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:25,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:25,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:25,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:25,126 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:25,126 INFO L481 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-03-20 01:26:25,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,183 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-20 01:26:26,184 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:26,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 53364588, now seen corresponding path program 1 times [2025-03-20 01:26:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262573044] [2025-03-20 01:26:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:26,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-20 01:26:26,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-20 01:26:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262573044] [2025-03-20 01:26:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262573044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815500745] [2025-03-20 01:26:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:26,278 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:26,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:26,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:26,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,279 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:26,279 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:26,279 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,279 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:26,486 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-20 01:26:26,486 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:26,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1815769700, now seen corresponding path program 1 times [2025-03-20 01:26:26,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:26,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248503727] [2025-03-20 01:26:26,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:26,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-20 01:26:26,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-20 01:26:26,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:26,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248503727] [2025-03-20 01:26:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248503727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541461619] [2025-03-20 01:26:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:26,619 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:26,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:26,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:26,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:26,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,620 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:26,620 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-03-20 01:26:26,620 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,620 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:26,620 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:26,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:26,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:26,699 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-20 01:26:26,699 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:26,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1953601191, now seen corresponding path program 1 times [2025-03-20 01:26:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022391124] [2025-03-20 01:26:26,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:26,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-20 01:26:26,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 01:26:26,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:26,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:26,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:26,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-20 01:26:26,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-20 01:26:26,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:26,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:26,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:26,734 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:26,734 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:26,735 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:26,735 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-20 01:26:26,737 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:26,737 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:26,737 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-03-20 01:26:26,756 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-20 01:26:26,759 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:26,770 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:26,770 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:26,771 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:26,771 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:27,541 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:27,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:27,541 INFO L85 PathProgramCache]: Analyzing trace with hash 46388210, now seen corresponding path program 1 times [2025-03-20 01:26:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243054713] [2025-03-20 01:26:27,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:27,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-20 01:26:27,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-20 01:26:27,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:27,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:27,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243054713] [2025-03-20 01:26:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243054713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:27,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133434894] [2025-03-20 01:26:27,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:27,566 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:27,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:27,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:27,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:27,567 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:27,568 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 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-03-20 01:26:27,568 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:28,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:28,905 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-20 01:26:28,905 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:28,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2144231078, now seen corresponding path program 1 times [2025-03-20 01:26:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099382464] [2025-03-20 01:26:28,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:28,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-20 01:26:28,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-20 01:26:28,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:28,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:28,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099382464] [2025-03-20 01:26:28,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099382464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:28,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097864770] [2025-03-20 01:26:28,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:28,975 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:28,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:28,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:28,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:28,976 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:28,977 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-03-20 01:26:28,977 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:28,977 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:29,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:29,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:29,274 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-20 01:26:29,274 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:29,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1431998770, now seen corresponding path program 1 times [2025-03-20 01:26:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:29,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400847663] [2025-03-20 01:26:29,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:29,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:29,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-20 01:26:29,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-20 01:26:29,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:29,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400847663] [2025-03-20 01:26:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400847663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:29,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:29,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844207524] [2025-03-20 01:26:29,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:29,426 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:29,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:29,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:29,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:29,428 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:29,428 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-03-20 01:26:29,428 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:29,428 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:29,428 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:29,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:29,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:29,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:29,605 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-20 01:26:29,605 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:29,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1980613307, now seen corresponding path program 1 times [2025-03-20 01:26:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486386941] [2025-03-20 01:26:29,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:29,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-20 01:26:29,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-20 01:26:29,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:29,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:29,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:29,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-20 01:26:29,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-20 01:26:29,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:29,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:29,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:29,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:29,662 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:29,662 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:29,662 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-20 01:26:29,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:29,663 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:29,663 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-03-20 01:26:29,682 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-03-20 01:26:29,684 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:29,696 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:29,696 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:29,697 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:29,697 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:30,605 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:30,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -235237260, now seen corresponding path program 1 times [2025-03-20 01:26:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847752096] [2025-03-20 01:26:30,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:30,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-20 01:26:30,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-20 01:26:30,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:30,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:30,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847752096] [2025-03-20 01:26:30,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847752096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:30,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:30,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:30,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069553229] [2025-03-20 01:26:30,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:30,621 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:30,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:30,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:30,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:30,622 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:30,622 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-03-20 01:26:30,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:32,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:32,432 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-20 01:26:32,433 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:32,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 535828186, now seen corresponding path program 1 times [2025-03-20 01:26:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808679740] [2025-03-20 01:26:32,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:32,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-20 01:26:32,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-20 01:26:32,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:32,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:32,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808679740] [2025-03-20 01:26:32,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808679740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:32,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:32,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:32,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754582534] [2025-03-20 01:26:32,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:32,524 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:32,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:32,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:32,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:32,525 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:32,525 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:32,525 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:32,525 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:32,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:32,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:32,896 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-20 01:26:32,896 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:32,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1868352781, now seen corresponding path program 1 times [2025-03-20 01:26:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:32,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226925289] [2025-03-20 01:26:32,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:32,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:32,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-20 01:26:32,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-20 01:26:32,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:32,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:33,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226925289] [2025-03-20 01:26:33,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226925289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:33,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:33,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299843946] [2025-03-20 01:26:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:33,059 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:33,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:33,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:33,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:33,060 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:33,060 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-03-20 01:26:33,060 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:33,060 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:33,060 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:33,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:33,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:33,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:33,276 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-20 01:26:33,276 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:33,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1239365544, now seen corresponding path program 1 times [2025-03-20 01:26:33,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:33,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65569671] [2025-03-20 01:26:33,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:33,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-20 01:26:33,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-20 01:26:33,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:33,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:33,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:33,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-20 01:26:33,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-20 01:26:33,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:33,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:33,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:33,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:33,316 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:33,316 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:33,316 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-20 01:26:33,317 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:33,318 WARN L247 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:33,318 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-03-20 01:26:33,343 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-20 01:26:33,345 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:33,359 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:33,359 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:33,359 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:33,360 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:34,455 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:34,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1515241781, now seen corresponding path program 1 times [2025-03-20 01:26:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907173794] [2025-03-20 01:26:34,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:34,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:34,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-20 01:26:34,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-20 01:26:34,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:34,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907173794] [2025-03-20 01:26:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907173794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:34,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311521959] [2025-03-20 01:26:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:34,475 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:34,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:34,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:34,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:34,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:34,476 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:34,476 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-03-20 01:26:34,476 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:36,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:36,764 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-20 01:26:36,764 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:36,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1620195665, now seen corresponding path program 1 times [2025-03-20 01:26:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:36,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054705226] [2025-03-20 01:26:36,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:36,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-20 01:26:36,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-20 01:26:36,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:36,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054705226] [2025-03-20 01:26:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054705226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:36,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:36,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:36,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859421527] [2025-03-20 01:26:36,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:36,847 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:36,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:36,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:36,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:36,848 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:36,848 INFO L481 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-03-20 01:26:36,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:36,848 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:37,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:37,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:37,318 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-20 01:26:37,318 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:37,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1365746747, now seen corresponding path program 1 times [2025-03-20 01:26:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351653159] [2025-03-20 01:26:37,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:37,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-20 01:26:37,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-20 01:26:37,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:37,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351653159] [2025-03-20 01:26:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351653159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482791077] [2025-03-20 01:26:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:37,473 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:37,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:37,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:37,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:37,473 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:37,473 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 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-03-20 01:26:37,474 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:37,474 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:37,474 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:37,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:37,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:37,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:37,775 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-20 01:26:37,775 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:37,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:37,775 INFO L85 PathProgramCache]: Analyzing trace with hash 820179926, now seen corresponding path program 1 times [2025-03-20 01:26:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555927530] [2025-03-20 01:26:37,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-20 01:26:37,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-20 01:26:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:37,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:37,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-20 01:26:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-20 01:26:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:37,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:37,818 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:37,818 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:37,818 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:37,818 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-20 01:26:37,819 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:37,819 WARN L247 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:37,819 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-03-20 01:26:37,842 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-03-20 01:26:37,847 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:37,860 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:37,860 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:37,860 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:37,860 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:39,167 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:39,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -902653753, now seen corresponding path program 1 times [2025-03-20 01:26:39,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:39,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11896730] [2025-03-20 01:26:39,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:39,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-20 01:26:39,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-20 01:26:39,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:39,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11896730] [2025-03-20 01:26:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11896730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515604403] [2025-03-20 01:26:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:39,184 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:39,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:39,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:39,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:39,184 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:39,184 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 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-03-20 01:26:39,184 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:41,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:41,799 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-20 01:26:41,799 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:41,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash -733758210, now seen corresponding path program 1 times [2025-03-20 01:26:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:41,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498831072] [2025-03-20 01:26:41,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:41,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-20 01:26:41,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-20 01:26:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:41,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:41,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498831072] [2025-03-20 01:26:41,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498831072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:41,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:41,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150765717] [2025-03-20 01:26:41,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:41,920 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:41,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:41,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:41,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:41,920 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:41,920 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:41,920 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:41,920 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:42,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:42,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:42,406 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-20 01:26:42,406 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:42,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash -563341414, now seen corresponding path program 1 times [2025-03-20 01:26:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:42,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488254883] [2025-03-20 01:26:42,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:42,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:42,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-20 01:26:42,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-20 01:26:42,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:42,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488254883] [2025-03-20 01:26:42,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488254883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:42,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:42,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092982000] [2025-03-20 01:26:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:42,551 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:42,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:42,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:42,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:42,551 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:42,552 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:42,552 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:42,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:42,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:42,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:42,978 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-20 01:26:42,978 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:42,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1605945160, now seen corresponding path program 1 times [2025-03-20 01:26:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62390777] [2025-03-20 01:26:42,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:42,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:42,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-20 01:26:43,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-20 01:26:43,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:43,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:43,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:43,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-20 01:26:43,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-20 01:26:43,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:43,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:43,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:43,034 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:43,034 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:43,034 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:43,034 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-20 01:26:43,036 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:43,036 WARN L247 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:43,036 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-03-20 01:26:43,064 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-20 01:26:43,066 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:43,081 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:43,081 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:43,081 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:43,081 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:44,600 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:44,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1763063717, now seen corresponding path program 1 times [2025-03-20 01:26:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114339545] [2025-03-20 01:26:44,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:44,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-20 01:26:44,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-20 01:26:44,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:44,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:44,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114339545] [2025-03-20 01:26:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114339545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:44,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:44,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:44,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989988238] [2025-03-20 01:26:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:44,620 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:44,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:44,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:44,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:44,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:44,621 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:44,621 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:44,621 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:47,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:47,713 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-20 01:26:47,713 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:47,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1523397265, now seen corresponding path program 1 times [2025-03-20 01:26:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451024967] [2025-03-20 01:26:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:47,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-20 01:26:47,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-20 01:26:47,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:47,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:47,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:47,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451024967] [2025-03-20 01:26:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451024967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:47,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263819000] [2025-03-20 01:26:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:47,797 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:47,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:47,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:47,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:47,798 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:47,798 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 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-03-20 01:26:47,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:47,798 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:48,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:48,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:48,397 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-20 01:26:48,397 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:48,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1419944662, now seen corresponding path program 1 times [2025-03-20 01:26:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491505093] [2025-03-20 01:26:48,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:48,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-20 01:26:48,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-20 01:26:48,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:48,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491505093] [2025-03-20 01:26:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491505093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:48,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:48,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68363147] [2025-03-20 01:26:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:48,553 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:48,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:48,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:48,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:48,554 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:48,554 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 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-03-20 01:26:48,554 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:48,554 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:48,554 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:48,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:48,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:48,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:48,998 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-20 01:26:48,998 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:48,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash -237986408, now seen corresponding path program 1 times [2025-03-20 01:26:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:48,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350331377] [2025-03-20 01:26:48,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:49,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-20 01:26:49,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-20 01:26:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:49,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:49,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-20 01:26:49,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-20 01:26:49,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:49,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:49,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:49,074 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:49,074 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:49,074 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:49,074 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-20 01:26:49,075 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:49,075 WARN L247 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:49,075 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-03-20 01:26:49,100 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2025-03-20 01:26:49,101 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:49,120 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:49,120 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:49,120 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:49,120 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:50,921 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:50,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 70765231, now seen corresponding path program 1 times [2025-03-20 01:26:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558834955] [2025-03-20 01:26:50,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:50,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-20 01:26:50,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-20 01:26:50,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:50,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:50,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558834955] [2025-03-20 01:26:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558834955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899779968] [2025-03-20 01:26:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:50,940 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:50,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:50,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:50,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:50,940 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:50,940 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:26:50,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:54,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:54,790 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-20 01:26:54,790 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:54,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -685465792, now seen corresponding path program 1 times [2025-03-20 01:26:54,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:54,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533165218] [2025-03-20 01:26:54,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:54,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-20 01:26:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-20 01:26:54,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:54,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:54,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533165218] [2025-03-20 01:26:54,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533165218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:54,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:26:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150756698] [2025-03-20 01:26:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:54,871 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:26:54,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:54,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:26:54,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:26:54,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:54,871 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:54,871 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-03-20 01:26:54,871 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:54,871 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:55,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:55,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:55,485 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-20 01:26:55,485 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:55,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1817123256, now seen corresponding path program 1 times [2025-03-20 01:26:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287484589] [2025-03-20 01:26:55,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:55,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-20 01:26:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-20 01:26:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:55,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287484589] [2025-03-20 01:26:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287484589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:55,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:26:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119414787] [2025-03-20 01:26:55,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:55,692 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:26:55,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:55,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:26:55,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:26:55,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:55,692 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:55,692 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 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-03-20 01:26:55,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:55,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:55,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:56,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:56,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:26:56,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:26:56,266 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-20 01:26:56,266 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:56,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash 428405438, now seen corresponding path program 1 times [2025-03-20 01:26:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:56,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732417197] [2025-03-20 01:26:56,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:56,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-20 01:26:56,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-20 01:26:56,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:56,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:56,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:26:56,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-20 01:26:56,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-20 01:26:56,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:26:56,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:26:56,310 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:26:56,310 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:26:56,310 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:26:56,310 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-20 01:26:56,311 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:26:56,311 WARN L247 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:26:56,311 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-03-20 01:26:56,336 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-20 01:26:56,338 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:56,359 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:26:56,359 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:26:56,359 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:26:56,359 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:26:58,375 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:26:58,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:26:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash 719635066, now seen corresponding path program 1 times [2025-03-20 01:26:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:26:58,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976632838] [2025-03-20 01:26:58,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:26:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:26:58,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-20 01:26:58,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-20 01:26:58,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:26:58,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:26:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:26:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:26:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976632838] [2025-03-20 01:26:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976632838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:26:58,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:26:58,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:26:58,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394497319] [2025-03-20 01:26:58,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:26:58,396 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:26:58,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:26:58,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:26:58,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:26:58,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:26:58,396 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:26:58,396 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 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-03-20 01:26:58,396 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:02,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:02,754 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-20 01:27:02,754 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:02,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash 477232, now seen corresponding path program 1 times [2025-03-20 01:27:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971105620] [2025-03-20 01:27:02,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:02,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:02,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-20 01:27:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-20 01:27:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971105620] [2025-03-20 01:27:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971105620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:02,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:02,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:27:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976833500] [2025-03-20 01:27:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:02,889 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:27:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:02,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:27:02,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:27:02,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:02,889 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:02,889 INFO L481 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-03-20 01:27:02,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:02,889 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:03,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:03,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:03,621 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-20 01:27:03,621 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:03,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1942899113, now seen corresponding path program 1 times [2025-03-20 01:27:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108846994] [2025-03-20 01:27:03,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:03,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-20 01:27:03,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-20 01:27:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:03,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108846994] [2025-03-20 01:27:03,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108846994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:03,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:03,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:27:03,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797813263] [2025-03-20 01:27:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:03,817 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:27:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:03,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:27:03,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:27:03,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:03,817 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:03,817 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 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-03-20 01:27:03,817 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:03,817 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:03,817 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:04,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:04,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:04,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:27:04,744 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-20 01:27:04,744 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:04,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash -679383633, now seen corresponding path program 1 times [2025-03-20 01:27:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:04,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219729466] [2025-03-20 01:27:04,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:04,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-20 01:27:04,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-20 01:27:04,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:04,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:04,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:27:04,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-20 01:27:04,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-20 01:27:04,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:04,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:04,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:27:04,794 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:27:04,794 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:27:04,795 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:27:04,795 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-20 01:27:04,796 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-20 01:27:04,796 WARN L247 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:27:04,796 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-03-20 01:27:04,832 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-03-20 01:27:04,834 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:04,853 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:27:04,853 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:27:04,853 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:04,853 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:27:07,190 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:07,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2001614440, now seen corresponding path program 1 times [2025-03-20 01:27:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:07,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586099628] [2025-03-20 01:27:07,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:07,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:07,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-20 01:27:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-20 01:27:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586099628] [2025-03-20 01:27:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586099628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:07,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:07,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:27:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676619649] [2025-03-20 01:27:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:07,215 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:27:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:07,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:27:07,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:27:07,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:07,216 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:07,216 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 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-03-20 01:27:07,216 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:12,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:12,313 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-20 01:27:12,313 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:12,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -989986050, now seen corresponding path program 1 times [2025-03-20 01:27:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:12,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978563728] [2025-03-20 01:27:12,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-20 01:27:12,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-20 01:27:12,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:12,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:12,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978563728] [2025-03-20 01:27:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978563728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:27:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260579976] [2025-03-20 01:27:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:12,409 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:27:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:12,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:27:12,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:27:12,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:12,409 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:12,409 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-03-20 01:27:12,409 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:12,409 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:13,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:13,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:13,273 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-20 01:27:13,273 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:13,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:13,274 INFO L85 PathProgramCache]: Analyzing trace with hash 557642182, now seen corresponding path program 2 times [2025-03-20 01:27:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70881422] [2025-03-20 01:27:13,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:27:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:13,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 227 statements into 1 equivalence classes. [2025-03-20 01:27:13,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-20 01:27:13,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:27:13,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:13,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:13,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70881422] [2025-03-20 01:27:13,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70881422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:13,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:13,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:27:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715819583] [2025-03-20 01:27:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:13,545 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:27:13,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:13,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:27:13,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:27:13,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:13,546 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:13,546 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 4 states have internal predecessors, (206), 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-03-20 01:27:13,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:13,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:13,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:14,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:14,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:14,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:27:14,675 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-20 01:27:14,675 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:14,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1564481465, now seen corresponding path program 1 times [2025-03-20 01:27:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809846624] [2025-03-20 01:27:14,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:14,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:14,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-20 01:27:14,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-20 01:27:14,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:14,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:14,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:27:14,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-20 01:27:14,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-20 01:27:14,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:14,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:14,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:27:14,730 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:27:14,730 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:27:14,730 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:27:14,730 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-20 01:27:14,733 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:27:14,733 WARN L247 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:27:14,733 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-03-20 01:27:14,767 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2025-03-20 01:27:14,770 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:14,791 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:27:14,791 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:27:14,791 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:14,791 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:27:17,351 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:17,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash -870507458, now seen corresponding path program 1 times [2025-03-20 01:27:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:17,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019999142] [2025-03-20 01:27:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:17,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-20 01:27:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-20 01:27:17,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019999142] [2025-03-20 01:27:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019999142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:27:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423839096] [2025-03-20 01:27:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:17,374 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:27:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:17,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:27:17,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:27:17,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:17,375 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:17,375 INFO L481 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-03-20 01:27:17,375 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:23,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:23,313 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-20 01:27:23,313 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:23,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1873755052, now seen corresponding path program 1 times [2025-03-20 01:27:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317603191] [2025-03-20 01:27:23,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:23,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-20 01:27:23,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-20 01:27:23,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:23,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:23,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:23,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317603191] [2025-03-20 01:27:23,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317603191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:23,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:23,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:27:23,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832053679] [2025-03-20 01:27:23,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:23,431 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:27:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:23,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:27:23,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:27:23,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:23,432 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:23,432 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 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-03-20 01:27:23,432 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:23,432 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:24,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:24,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:24,375 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-20 01:27:24,375 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:24,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -996257746, now seen corresponding path program 2 times [2025-03-20 01:27:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248918271] [2025-03-20 01:27:24,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:27:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:24,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 246 statements into 1 equivalence classes. [2025-03-20 01:27:24,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-20 01:27:24,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:27:24,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248918271] [2025-03-20 01:27:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248918271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:27:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443012738] [2025-03-20 01:27:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:24,679 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:27:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:24,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:27:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:27:24,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:24,680 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:24,680 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 4 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-03-20 01:27:24,680 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:24,680 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:24,680 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:25,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:25,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:25,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:27:25,988 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-20 01:27:25,988 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:25,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:25,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1542521608, now seen corresponding path program 1 times [2025-03-20 01:27:25,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:25,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899633351] [2025-03-20 01:27:25,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:26,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-20 01:27:26,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-20 01:27:26,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:26,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:26,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:27:26,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-20 01:27:26,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-20 01:27:26,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:26,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:26,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:27:26,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:27:26,047 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:27:26,047 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:27:26,047 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-20 01:27:26,049 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:27:26,049 WARN L247 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:27:26,049 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-03-20 01:27:26,084 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2025-03-20 01:27:26,086 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:26,109 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:27:26,109 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:27:26,109 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:26,109 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:27:28,986 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:28,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -5418586, now seen corresponding path program 1 times [2025-03-20 01:27:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559334947] [2025-03-20 01:27:28,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:29,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-20 01:27:29,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-20 01:27:29,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:29,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:29,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559334947] [2025-03-20 01:27:29,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559334947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:29,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:29,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:27:29,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586454608] [2025-03-20 01:27:29,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:29,011 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:27:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:29,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:27:29,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:27:29,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:29,011 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:29,011 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 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-03-20 01:27:29,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:35,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:35,612 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-20 01:27:35,612 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:35,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1698757498, now seen corresponding path program 1 times [2025-03-20 01:27:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704059461] [2025-03-20 01:27:35,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:35,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-20 01:27:35,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-20 01:27:35,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704059461] [2025-03-20 01:27:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704059461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:35,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:27:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819563083] [2025-03-20 01:27:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:35,736 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:27:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:35,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:27:35,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:27:35,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:35,736 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:35,736 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-03-20 01:27:35,737 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:35,737 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:36,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:36,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:36,625 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-20 01:27:36,625 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:36,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1721360306, now seen corresponding path program 2 times [2025-03-20 01:27:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238979471] [2025-03-20 01:27:36,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:27:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:36,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 265 statements into 1 equivalence classes. [2025-03-20 01:27:36,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-20 01:27:36,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:27:36,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238979471] [2025-03-20 01:27:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238979471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:36,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:36,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:27:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912895817] [2025-03-20 01:27:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:36,866 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:27:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:36,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:27:36,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:27:36,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:36,867 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:36,867 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 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-03-20 01:27:36,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:36,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:36,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:38,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:38,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:38,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:27:38,673 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-20 01:27:38,673 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:38,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1351983383, now seen corresponding path program 1 times [2025-03-20 01:27:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:38,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395895467] [2025-03-20 01:27:38,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:38,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-20 01:27:38,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-20 01:27:38,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:38,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:38,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:27:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-20 01:27:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-20 01:27:38,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:38,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:38,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:27:38,740 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:27:38,740 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:27:38,740 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:27:38,740 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-20 01:27:38,742 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:27:38,742 WARN L247 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:27:38,742 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-03-20 01:27:38,773 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-03-20 01:27:38,775 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:38,800 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:27:38,801 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:27:38,801 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:38,801 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:27:42,084 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:42,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2099665552, now seen corresponding path program 1 times [2025-03-20 01:27:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5702183] [2025-03-20 01:27:42,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:42,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-20 01:27:42,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-20 01:27:42,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5702183] [2025-03-20 01:27:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5702183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:42,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:27:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549567904] [2025-03-20 01:27:42,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:42,109 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:27:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:42,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:27:42,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:27:42,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:42,109 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:42,109 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:27:42,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:49,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:49,390 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-20 01:27:49,390 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:49,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2029217518, now seen corresponding path program 1 times [2025-03-20 01:27:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962387642] [2025-03-20 01:27:49,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:49,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-20 01:27:49,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-20 01:27:49,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:49,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:49,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:49,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962387642] [2025-03-20 01:27:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962387642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:27:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026657133] [2025-03-20 01:27:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:49,580 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:27:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:49,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:27:49,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:27:49,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:49,580 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:49,581 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-03-20 01:27:49,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:49,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:50,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:50,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:50,608 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-20 01:27:50,608 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:50,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1807126030, now seen corresponding path program 2 times [2025-03-20 01:27:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193666539] [2025-03-20 01:27:50,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:27:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:50,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 284 statements into 1 equivalence classes. [2025-03-20 01:27:50,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-20 01:27:50,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:27:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193666539] [2025-03-20 01:27:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193666539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:27:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006054487] [2025-03-20 01:27:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:50,894 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:27:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:50,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:27:50,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:27:50,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:50,894 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:50,895 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 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-03-20 01:27:50,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:50,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:50,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:53,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:53,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:27:53,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:27:53,130 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-20 01:27:53,130 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:53,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1976076767, now seen corresponding path program 1 times [2025-03-20 01:27:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892828762] [2025-03-20 01:27:53,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-20 01:27:53,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-20 01:27:53,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:53,160 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:27:53,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-20 01:27:53,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-20 01:27:53,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:53,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:27:53,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:27:53,202 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:27:53,202 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:27:53,202 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:27:53,203 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-20 01:27:53,203 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:27:53,204 WARN L247 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:27:53,204 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-03-20 01:27:53,241 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2025-03-20 01:27:53,243 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:53,269 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:27:53,269 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:27:53,269 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:27:53,269 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:27:56,722 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:27:56,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:27:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash 799196301, now seen corresponding path program 1 times [2025-03-20 01:27:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:27:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614892644] [2025-03-20 01:27:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:27:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:27:56,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-20 01:27:56,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-20 01:27:56,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:27:56,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:27:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:27:56,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:27:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614892644] [2025-03-20 01:27:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614892644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:27:56,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:27:56,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:27:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318113422] [2025-03-20 01:27:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:27:56,749 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:27:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:27:56,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:27:56,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:27:56,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:27:56,749 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:27:56,749 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:27:56,749 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:04,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:04,870 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-20 01:28:04,870 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:04,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1056908893, now seen corresponding path program 1 times [2025-03-20 01:28:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:04,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420473415] [2025-03-20 01:28:04,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:04,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:04,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-20 01:28:04,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-20 01:28:04,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:04,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:04,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-03-20 01:28:04,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:04,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420473415] [2025-03-20 01:28:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420473415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:04,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:28:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346407275] [2025-03-20 01:28:04,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:04,997 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:28:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:04,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:28:04,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:28:04,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:04,998 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:04,998 INFO L481 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-03-20 01:28:04,998 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:04,998 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:05,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:05,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:05,914 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-20 01:28:05,914 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:05,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash 937443073, now seen corresponding path program 2 times [2025-03-20 01:28:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238137168] [2025-03-20 01:28:05,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:28:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:05,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 303 statements into 1 equivalence classes. [2025-03-20 01:28:05,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-20 01:28:05,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:28:05,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238137168] [2025-03-20 01:28:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238137168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:28:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563954911] [2025-03-20 01:28:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:06,317 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:28:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:06,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:28:06,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:28:06,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:06,317 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:06,317 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 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-03-20 01:28:06,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:06,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:06,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:08,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:08,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:08,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:28:08,639 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-20 01:28:08,639 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:08,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash 584670750, now seen corresponding path program 1 times [2025-03-20 01:28:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834698905] [2025-03-20 01:28:08,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:08,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:08,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-20 01:28:08,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-20 01:28:08,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:08,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:28:08,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:28:08,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-20 01:28:08,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-20 01:28:08,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:08,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:28:08,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:28:08,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:28:08,713 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:28:08,713 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:28:08,713 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-20 01:28:08,714 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:28:08,714 WARN L247 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:28:08,714 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-03-20 01:28:08,750 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-20 01:28:08,753 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:28:08,778 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:28:08,778 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:28:08,779 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:28:08,779 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:28:13,018 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:13,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1371824163, now seen corresponding path program 1 times [2025-03-20 01:28:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750875972] [2025-03-20 01:28:13,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:13,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-20 01:28:13,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-20 01:28:13,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:13,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:13,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-03-20 01:28:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750875972] [2025-03-20 01:28:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750875972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:13,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:28:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023880411] [2025-03-20 01:28:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:13,048 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:28:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:13,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:28:13,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:28:13,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:13,048 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:13,048 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.5) internal successors, (121), 2 states have internal predecessors, (121), 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-03-20 01:28:13,048 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:22,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:22,158 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-20 01:28:22,158 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:22,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2044880342, now seen corresponding path program 1 times [2025-03-20 01:28:22,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:22,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261870635] [2025-03-20 01:28:22,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:22,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-20 01:28:22,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-20 01:28:22,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:22,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261870635] [2025-03-20 01:28:22,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261870635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:22,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:28:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622450221] [2025-03-20 01:28:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:22,300 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:28:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:22,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:28:22,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:28:22,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:22,300 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:22,300 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:28:22,300 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:22,300 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:23,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:23,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:23,340 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-20 01:28:23,340 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:23,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 249810790, now seen corresponding path program 2 times [2025-03-20 01:28:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195437685] [2025-03-20 01:28:23,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:28:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:23,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 322 statements into 1 equivalence classes. [2025-03-20 01:28:23,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-20 01:28:23,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:28:23,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:23,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:23,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195437685] [2025-03-20 01:28:23,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195437685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:23,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:23,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:28:23,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970056860] [2025-03-20 01:28:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:23,843 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:28:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:23,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:28:23,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:28:23,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:23,844 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:23,844 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.2) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:28:23,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:23,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:23,844 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:27,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:27,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:27,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:28:27,036 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-20 01:28:27,037 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:27,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1564607376, now seen corresponding path program 1 times [2025-03-20 01:28:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623493887] [2025-03-20 01:28:27,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:27,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-20 01:28:27,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-20 01:28:27,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:27,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:28:27,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:28:27,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-20 01:28:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-20 01:28:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:28:27,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:28:27,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:28:27,118 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:28:27,118 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:28:27,119 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-20 01:28:27,120 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:28:27,120 WARN L247 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:28:27,120 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-03-20 01:28:27,160 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2025-03-20 01:28:27,162 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:28:27,191 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:28:27,192 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:28:27,192 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:28:27,192 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:28:31,743 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:31,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:31,743 INFO L85 PathProgramCache]: Analyzing trace with hash -390487238, now seen corresponding path program 1 times [2025-03-20 01:28:31,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:31,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832147515] [2025-03-20 01:28:31,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:31,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-20 01:28:31,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-20 01:28:31,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:31,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:31,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:31,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832147515] [2025-03-20 01:28:31,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832147515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:31,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:31,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:28:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431902423] [2025-03-20 01:28:31,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:31,773 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:28:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:31,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:28:31,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:28:31,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:31,774 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:31,774 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 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-03-20 01:28:31,774 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:42,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:42,344 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-20 01:28:42,344 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:42,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash -895594100, now seen corresponding path program 1 times [2025-03-20 01:28:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542733295] [2025-03-20 01:28:42,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:42,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-20 01:28:42,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-20 01:28:42,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:42,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542733295] [2025-03-20 01:28:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542733295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:42,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:42,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:28:42,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17300787] [2025-03-20 01:28:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:42,559 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:28:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:42,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:28:42,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:28:42,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:42,560 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:42,560 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-03-20 01:28:42,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:42,560 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:43,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:43,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:43,520 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-20 01:28:43,520 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:43,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1037345662, now seen corresponding path program 2 times [2025-03-20 01:28:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:43,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915407932] [2025-03-20 01:28:43,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:28:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:43,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 341 statements into 1 equivalence classes. [2025-03-20 01:28:43,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-20 01:28:43,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:28:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915407932] [2025-03-20 01:28:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915407932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:28:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585666825] [2025-03-20 01:28:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:43,845 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:28:43,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:28:43,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:28:43,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:43,846 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:43,846 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 4 states have internal predecessors, (308), 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-03-20 01:28:43,846 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:43,846 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:43,846 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:47,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:47,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:28:47,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:28:47,541 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-20 01:28:47,541 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:47,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1572867456, now seen corresponding path program 1 times [2025-03-20 01:28:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:47,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587817770] [2025-03-20 01:28:47,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:47,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-20 01:28:47,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-20 01:28:47,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:47,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:28:47,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:28:47,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-20 01:28:47,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-20 01:28:47,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:47,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:28:47,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:28:47,637 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:28:47,637 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:28:47,637 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:28:47,637 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-20 01:28:47,639 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:28:47,639 WARN L247 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:28:47,639 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-03-20 01:28:47,688 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-03-20 01:28:47,691 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:28:47,726 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:28:47,727 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:28:47,727 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:28:47,727 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:28:52,875 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:28:52,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:28:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1750872303, now seen corresponding path program 1 times [2025-03-20 01:28:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:28:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403546145] [2025-03-20 01:28:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:28:52,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:28:52,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-20 01:28:52,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-20 01:28:52,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:28:52,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:28:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:28:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:28:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403546145] [2025-03-20 01:28:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403546145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:28:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:28:52,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:28:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611305498] [2025-03-20 01:28:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:28:52,910 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:28:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:28:52,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:28:52,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:28:52,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:28:52,910 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:28:52,910 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 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-03-20 01:28:52,910 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:04,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:04,391 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-20 01:29:04,391 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:04,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -329769132, now seen corresponding path program 1 times [2025-03-20 01:29:04,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:04,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422467293] [2025-03-20 01:29:04,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:04,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-20 01:29:04,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-20 01:29:04,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:04,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422467293] [2025-03-20 01:29:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422467293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:04,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:04,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:29:04,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76806469] [2025-03-20 01:29:04,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:04,659 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:29:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:04,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:29:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:29:04,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:04,660 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:04,660 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-03-20 01:29:04,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:04,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:05,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:05,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:05,638 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-20 01:29:05,638 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:05,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -374830206, now seen corresponding path program 2 times [2025-03-20 01:29:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:05,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943332432] [2025-03-20 01:29:05,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:29:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:05,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 360 statements into 1 equivalence classes. [2025-03-20 01:29:05,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-20 01:29:05,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:29:05,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:06,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943332432] [2025-03-20 01:29:06,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943332432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:29:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272981167] [2025-03-20 01:29:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:06,004 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:29:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:06,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:29:06,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:29:06,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:06,005 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:06,005 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 4 states have internal predecessors, (325), 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-03-20 01:29:06,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:06,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:06,005 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:09,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:09,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:09,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:29:09,505 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-20 01:29:09,505 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:09,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1842167459, now seen corresponding path program 1 times [2025-03-20 01:29:09,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:09,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435272611] [2025-03-20 01:29:09,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-20 01:29:09,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-20 01:29:09,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:09,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:29:09,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:29:09,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-20 01:29:09,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-20 01:29:09,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:09,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:29:09,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:29:09,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:29:09,599 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:29:09,600 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:29:09,600 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-20 01:29:09,601 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:29:09,601 WARN L247 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:29:09,601 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-03-20 01:29:09,646 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-03-20 01:29:09,649 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:29:09,687 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:29:09,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:29:09,687 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:29:09,687 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:29:14,955 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:14,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2084099332, now seen corresponding path program 1 times [2025-03-20 01:29:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964383810] [2025-03-20 01:29:14,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:14,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-20 01:29:14,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-20 01:29:14,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:14,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:14,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964383810] [2025-03-20 01:29:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964383810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:14,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:29:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836014635] [2025-03-20 01:29:14,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:14,992 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:29:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:14,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:29:14,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:29:14,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:14,992 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:14,992 INFO L481 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-03-20 01:29:14,993 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:28,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:28,368 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-03-20 01:29:28,368 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:28,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1024092994, now seen corresponding path program 1 times [2025-03-20 01:29:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:28,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403757904] [2025-03-20 01:29:28,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:28,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-03-20 01:29:28,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-20 01:29:28,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:28,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:28,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403757904] [2025-03-20 01:29:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403757904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:28,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:28,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:29:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267467720] [2025-03-20 01:29:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:28,546 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:29:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:28,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:29:28,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:29:28,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:28,546 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:28,547 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-03-20 01:29:28,547 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:28,547 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:29,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:29,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:29,530 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-03-20 01:29:29,530 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:29,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 989082922, now seen corresponding path program 2 times [2025-03-20 01:29:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010798331] [2025-03-20 01:29:29,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:29:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:29,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 379 statements into 1 equivalence classes. [2025-03-20 01:29:29,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-03-20 01:29:29,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:29:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010798331] [2025-03-20 01:29:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010798331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:29,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:29:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387393533] [2025-03-20 01:29:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:29,891 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:29:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:29,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:29:29,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:29:29,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:29,892 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:29,892 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 4 states have internal predecessors, (342), 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-03-20 01:29:29,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:29,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:29,892 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:33,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:33,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:33,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:29:33,925 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-03-20 01:29:33,925 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:33,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -152239944, now seen corresponding path program 1 times [2025-03-20 01:29:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750308980] [2025-03-20 01:29:33,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:33,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-20 01:29:33,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-20 01:29:33,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:33,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:29:33,965 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:29:33,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-20 01:29:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-20 01:29:33,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:33,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:29:34,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:29:34,025 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:29:34,026 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:29:34,026 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:29:34,026 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-03-20 01:29:34,027 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:29:34,027 WARN L247 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:29:34,027 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-03-20 01:29:34,072 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2025-03-20 01:29:34,075 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:29:34,108 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:29:34,109 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:29:34,109 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:29:34,109 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:29:39,981 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:39,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2116786277, now seen corresponding path program 1 times [2025-03-20 01:29:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:39,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12840370] [2025-03-20 01:29:39,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:40,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-20 01:29:40,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-20 01:29:40,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:40,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12840370] [2025-03-20 01:29:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12840370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:29:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413947511] [2025-03-20 01:29:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:40,017 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:29:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:40,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:29:40,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:29:40,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:40,018 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:40,018 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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-03-20 01:29:40,018 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:54,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:54,165 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-03-20 01:29:54,165 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:54,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 108733999, now seen corresponding path program 1 times [2025-03-20 01:29:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010760605] [2025-03-20 01:29:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:29:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:54,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-20 01:29:54,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-20 01:29:54,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:29:54,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010760605] [2025-03-20 01:29:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010760605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:29:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486865376] [2025-03-20 01:29:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:54,351 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:29:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:54,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:29:54,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:29:54,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:54,351 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:54,352 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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-03-20 01:29:54,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:54,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:55,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:55,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:55,732 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-03-20 01:29:55,732 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:29:55,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:29:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1558586255, now seen corresponding path program 2 times [2025-03-20 01:29:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:29:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36122372] [2025-03-20 01:29:55,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:29:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:29:55,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 1 equivalence classes. [2025-03-20 01:29:55,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-20 01:29:55,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:29:55,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:29:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:29:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:29:56,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36122372] [2025-03-20 01:29:56,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36122372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:29:56,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:29:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:29:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278484037] [2025-03-20 01:29:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:29:56,139 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:29:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:29:56,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:29:56,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:29:56,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:56,139 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:29:56,139 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 4 states have internal predecessors, (359), 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-03-20 01:29:56,140 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:29:56,140 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:29:56,140 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:01,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:01,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:30:01,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:30:01,258 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-03-20 01:30:01,258 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:01,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash -410246096, now seen corresponding path program 1 times [2025-03-20 01:30:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:01,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673811179] [2025-03-20 01:30:01,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:30:01,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:01,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-20 01:30:01,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-20 01:30:01,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:30:01,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:30:01,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-20 01:30:01,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-20 01:30:01,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:01,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:30:01,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:30:01,373 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:30:01,373 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:30:01,373 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:30:01,373 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-03-20 01:30:01,374 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:30:01,374 WARN L247 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:30:01,375 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-03-20 01:30:01,425 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2025-03-20 01:30:01,427 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:30:01,462 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:30:01,462 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:30:01,463 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:30:01,463 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:30:07,780 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:07,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1498709955, now seen corresponding path program 1 times [2025-03-20 01:30:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:07,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117043086] [2025-03-20 01:30:07,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:30:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:07,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-20 01:30:07,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-20 01:30:07,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:07,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:30:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:30:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:30:07,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117043086] [2025-03-20 01:30:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117043086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:30:07,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:30:07,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:30:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062253576] [2025-03-20 01:30:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:30:07,817 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:30:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:30:07,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:30:07,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:30:07,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:07,817 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:30:07,817 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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-03-20 01:30:07,817 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:22,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:22,783 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-03-20 01:30:22,783 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:22,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash -602309162, now seen corresponding path program 1 times [2025-03-20 01:30:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:22,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793400249] [2025-03-20 01:30:22,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:30:22,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:22,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-20 01:30:22,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-20 01:30:22,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:22,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:30:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:30:22,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:30:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793400249] [2025-03-20 01:30:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793400249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:30:22,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:30:22,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:30:22,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497222363] [2025-03-20 01:30:22,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:30:22,970 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:30:22,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:30:22,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:30:22,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:30:22,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:22,971 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:30:22,971 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-03-20 01:30:22,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:22,971 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:24,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:24,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:30:24,302 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-03-20 01:30:24,302 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:24,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1746868512, now seen corresponding path program 2 times [2025-03-20 01:30:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:24,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451606246] [2025-03-20 01:30:24,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:30:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:24,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 417 statements into 1 equivalence classes. [2025-03-20 01:30:24,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-20 01:30:24,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:30:24,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:30:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:30:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:30:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451606246] [2025-03-20 01:30:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451606246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:30:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:30:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:30:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6391900] [2025-03-20 01:30:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:30:24,710 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:30:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:30:24,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:30:24,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:30:24,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:24,710 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:30:24,711 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 4 states have internal predecessors, (376), 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-03-20 01:30:24,711 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:24,711 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:30:24,711 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:29,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:29,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:30:29,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:30:29,863 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-03-20 01:30:29,863 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:29,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 667103164, now seen corresponding path program 1 times [2025-03-20 01:30:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:29,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13760835] [2025-03-20 01:30:29,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:30:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:29,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-20 01:30:29,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-20 01:30:29,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:29,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:30:29,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:30:29,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-20 01:30:29,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-20 01:30:29,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:29,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:30:29,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:30:29,977 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:30:29,977 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:30:29,977 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:30:29,977 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-03-20 01:30:29,978 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:30:29,978 WARN L247 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:30:29,978 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-03-20 01:30:30,026 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2025-03-20 01:30:30,029 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:30:30,064 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:30:30,064 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:30:30,064 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:30:30,064 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:30:36,831 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:36,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:36,832 INFO L85 PathProgramCache]: Analyzing trace with hash 25192880, now seen corresponding path program 1 times [2025-03-20 01:30:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:36,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864119615] [2025-03-20 01:30:36,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:30:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:36,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-20 01:30:36,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-20 01:30:36,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:36,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:30:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:30:36,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:30:36,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864119615] [2025-03-20 01:30:36,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864119615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:30:36,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:30:36,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:30:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779506744] [2025-03-20 01:30:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:30:36,871 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:30:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:30:36,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:30:36,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:30:36,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:36,871 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:30:36,872 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 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-03-20 01:30:36,872 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:53,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:53,682 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-03-20 01:30:53,682 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:53,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash 440850249, now seen corresponding path program 1 times [2025-03-20 01:30:53,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077620411] [2025-03-20 01:30:53,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:30:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:53,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-20 01:30:53,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-20 01:30:53,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:30:53,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:30:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:30:53,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:30:53,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077620411] [2025-03-20 01:30:53,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077620411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:30:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:30:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:30:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476046452] [2025-03-20 01:30:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:30:53,883 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:30:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:30:53,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:30:53,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:30:53,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:53,883 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:30:53,883 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:30:53,883 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:53,883 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:55,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:55,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:30:55,082 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-03-20 01:30:55,082 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:30:55,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:30:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash -814820165, now seen corresponding path program 2 times [2025-03-20 01:30:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:30:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809876405] [2025-03-20 01:30:55,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:30:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:30:55,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 436 statements into 1 equivalence classes. [2025-03-20 01:30:55,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-20 01:30:55,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:30:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:30:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:30:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:30:55,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809876405] [2025-03-20 01:30:55,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809876405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:30:55,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:30:55,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:30:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376882685] [2025-03-20 01:30:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:30:55,497 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:30:55,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:30:55,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:30:55,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:30:55,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:55,497 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:30:55,497 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:30:55,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:30:55,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:30:55,497 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:00,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:00,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:31:00,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:31:00,817 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-03-20 01:31:00,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:31:00,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:31:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash 580487797, now seen corresponding path program 1 times [2025-03-20 01:31:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:31:00,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128105816] [2025-03-20 01:31:00,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:31:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:31:00,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-20 01:31:00,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-20 01:31:00,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:00,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:31:00,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:31:00,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-20 01:31:00,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-20 01:31:00,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:00,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:31:00,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:31:00,944 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:31:00,944 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:31:00,944 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:31:00,944 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-03-20 01:31:00,946 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:31:00,947 WARN L247 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:31:00,947 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-03-20 01:31:00,998 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2025-03-20 01:31:01,001 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:31:01,034 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:31:01,034 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:31:01,035 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:31:01,035 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:31:08,440 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:31:08,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:31:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1398819696, now seen corresponding path program 1 times [2025-03-20 01:31:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:31:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849932967] [2025-03-20 01:31:08,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:31:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:31:08,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-20 01:31:08,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-20 01:31:08,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:08,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:31:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:31:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:31:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849932967] [2025-03-20 01:31:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849932967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:31:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:31:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:31:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084817923] [2025-03-20 01:31:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:31:08,482 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:31:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:31:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:31:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:31:08,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:08,483 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:31:08,483 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 81.5) internal successors, (163), 2 states have internal predecessors, (163), 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-03-20 01:31:08,483 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:26,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:26,796 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-03-20 01:31:26,796 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:31:26,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:31:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash 202901913, now seen corresponding path program 1 times [2025-03-20 01:31:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:31:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047342185] [2025-03-20 01:31:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:31:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:31:26,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-20 01:31:26,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-20 01:31:26,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:26,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:31:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:31:27,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:31:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047342185] [2025-03-20 01:31:27,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047342185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:31:27,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:31:27,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:31:27,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089788258] [2025-03-20 01:31:27,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:31:27,004 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:31:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:31:27,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:31:27,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:31:27,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:27,004 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:31:27,004 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-03-20 01:31:27,004 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:27,004 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:28,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:28,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:31:28,080 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-03-20 01:31:28,081 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:31:28,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:31:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1065541483, now seen corresponding path program 2 times [2025-03-20 01:31:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:31:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780883434] [2025-03-20 01:31:28,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:31:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:31:28,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 455 statements into 1 equivalence classes. [2025-03-20 01:31:28,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-20 01:31:28,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:31:28,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:31:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:31:28,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:31:28,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780883434] [2025-03-20 01:31:28,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780883434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:31:28,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:31:28,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:31:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240228278] [2025-03-20 01:31:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:31:28,512 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:31:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:31:28,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:31:28,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:31:28,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:28,513 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:31:28,513 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 4 states have internal predecessors, (410), 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-03-20 01:31:28,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:28,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:31:28,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:34,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:34,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:31:34,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:31:34,405 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-03-20 01:31:34,405 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:31:34,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:31:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1221375709, now seen corresponding path program 1 times [2025-03-20 01:31:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:31:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510838910] [2025-03-20 01:31:34,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:31:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:31:34,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-20 01:31:34,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-20 01:31:34,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:34,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:31:34,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:31:34,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-20 01:31:34,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-20 01:31:34,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:34,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:31:34,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:31:34,540 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:31:34,540 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:31:34,540 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:31:34,540 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-03-20 01:31:34,542 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:31:34,542 WARN L247 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:31:34,542 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-03-20 01:31:34,590 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2025-03-20 01:31:34,592 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:31:34,632 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:31:34,633 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:31:34,633 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:31:34,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:31:43,046 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:31:43,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:31:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1983581557, now seen corresponding path program 1 times [2025-03-20 01:31:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:31:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410020686] [2025-03-20 01:31:43,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:31:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:31:43,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-20 01:31:43,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-20 01:31:43,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:31:43,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:31:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:31:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:31:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410020686] [2025-03-20 01:31:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410020686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:31:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:31:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:31:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591770767] [2025-03-20 01:31:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:31:43,090 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:31:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:31:43,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:31:43,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:31:43,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:31:43,090 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:31:43,090 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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-03-20 01:31:43,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:02,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:02,914 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-03-20 01:32:02,914 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:02,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash 7377298, now seen corresponding path program 1 times [2025-03-20 01:32:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847939135] [2025-03-20 01:32:02,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:32:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:02,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-20 01:32:02,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-20 01:32:02,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:02,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:32:03,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-03-20 01:32:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:32:03,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847939135] [2025-03-20 01:32:03,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847939135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:32:03,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:32:03,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:32:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54407056] [2025-03-20 01:32:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:32:03,135 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:32:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:32:03,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:32:03,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:32:03,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:03,136 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:32:03,136 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:32:03,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:03,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:04,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:04,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:32:04,603 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-03-20 01:32:04,603 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:04,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 344727802, now seen corresponding path program 2 times [2025-03-20 01:32:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733994717] [2025-03-20 01:32:04,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:32:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:04,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 474 statements into 1 equivalence classes. [2025-03-20 01:32:04,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-20 01:32:04,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:32:04,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:32:05,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-03-20 01:32:05,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:32:05,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733994717] [2025-03-20 01:32:05,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733994717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:32:05,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:32:05,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:32:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717548694] [2025-03-20 01:32:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:32:05,075 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:32:05,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:32:05,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:32:05,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:32:05,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:05,075 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:32:05,075 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:32:05,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:05,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:32:05,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:11,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:11,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:32:11,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:32:11,646 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-03-20 01:32:11,646 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:11,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash -757128515, now seen corresponding path program 1 times [2025-03-20 01:32:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395091741] [2025-03-20 01:32:11,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:32:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:11,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-20 01:32:11,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-20 01:32:11,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:11,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:32:11,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:32:11,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-20 01:32:11,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-20 01:32:11,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:11,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:32:11,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:32:11,796 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:32:11,796 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:32:11,796 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:32:11,796 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-03-20 01:32:11,798 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:32:11,798 WARN L247 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:32:11,798 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-03-20 01:32:11,848 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2025-03-20 01:32:11,850 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:32:11,887 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:32:11,888 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:32:11,888 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:32:11,888 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:32:20,173 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:20,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1154453337, now seen corresponding path program 1 times [2025-03-20 01:32:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302849801] [2025-03-20 01:32:20,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:32:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:20,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-20 01:32:20,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-20 01:32:20,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:20,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:32:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:32:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:32:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302849801] [2025-03-20 01:32:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302849801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:32:20,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:32:20,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:32:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261303272] [2025-03-20 01:32:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:32:20,219 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:32:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:32:20,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:32:20,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:32:20,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:20,220 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:32:20,220 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 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-03-20 01:32:20,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:41,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:41,177 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-03-20 01:32:41,177 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:41,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash 97468313, now seen corresponding path program 1 times [2025-03-20 01:32:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:41,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478447373] [2025-03-20 01:32:41,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:32:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:41,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-20 01:32:41,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-20 01:32:41,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:41,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:32:41,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-03-20 01:32:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:32:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478447373] [2025-03-20 01:32:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478447373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:32:41,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:32:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:32:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626689257] [2025-03-20 01:32:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:32:41,581 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:32:41,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:32:41,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:32:41,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:32:41,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:41,582 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:32:41,582 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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-03-20 01:32:41,582 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:41,582 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:42,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:42,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:32:42,673 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-03-20 01:32:42,673 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:42,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash 435718203, now seen corresponding path program 2 times [2025-03-20 01:32:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894772739] [2025-03-20 01:32:42,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:32:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:42,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 493 statements into 1 equivalence classes. [2025-03-20 01:32:42,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-20 01:32:42,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:32:42,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:32:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:32:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:32:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894772739] [2025-03-20 01:32:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894772739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:32:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:32:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:32:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010341480] [2025-03-20 01:32:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:32:43,154 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:32:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:32:43,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:32:43,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:32:43,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:43,155 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:32:43,155 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 4 states have internal predecessors, (444), 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-03-20 01:32:43,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:43,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:32:43,155 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:49,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:32:49,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:32:49,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:32:49,947 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-03-20 01:32:49,948 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:49,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2127890931, now seen corresponding path program 1 times [2025-03-20 01:32:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829846122] [2025-03-20 01:32:49,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:32:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:49,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-20 01:32:50,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-20 01:32:50,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:50,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:32:50,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:32:50,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-20 01:32:50,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-20 01:32:50,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:50,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:32:50,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:32:50,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:32:50,099 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:32:50,099 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:32:50,099 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-03-20 01:32:50,101 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:32:50,101 WARN L247 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:32:50,101 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-03-20 01:32:50,163 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2025-03-20 01:32:50,166 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:32:50,208 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:32:50,208 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:32:50,208 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:32:50,208 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:32:59,961 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:32:59,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:32:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 479726502, now seen corresponding path program 1 times [2025-03-20 01:32:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:32:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913420259] [2025-03-20 01:32:59,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:32:59,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:32:59,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-20 01:32:59,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-20 01:32:59,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:32:59,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:33:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:33:00,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:33:00,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913420259] [2025-03-20 01:33:00,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913420259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:33:00,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:33:00,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:33:00,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472482214] [2025-03-20 01:33:00,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:33:00,010 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:33:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:33:00,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:33:00,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:33:00,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:00,010 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:33:00,011 INFO L481 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-03-20 01:33:00,011 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:23,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:23,217 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-03-20 01:33:23,217 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:33:23,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:33:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1994824771, now seen corresponding path program 1 times [2025-03-20 01:33:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:33:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417931791] [2025-03-20 01:33:23,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:33:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:33:23,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-20 01:33:23,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-20 01:33:23,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:33:23,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:33:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:33:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:33:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417931791] [2025-03-20 01:33:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417931791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:33:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:33:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:33:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699931353] [2025-03-20 01:33:23,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:33:23,453 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:33:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:33:23,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:33:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:33:23,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:23,454 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:33:23,454 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-03-20 01:33:23,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:23,454 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:24,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:24,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:33:24,631 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-03-20 01:33:24,631 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:33:24,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:33:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1849866215, now seen corresponding path program 2 times [2025-03-20 01:33:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:33:24,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134344802] [2025-03-20 01:33:24,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:33:24,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:33:24,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 512 statements into 1 equivalence classes. [2025-03-20 01:33:24,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-20 01:33:24,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:33:24,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:33:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:33:25,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:33:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134344802] [2025-03-20 01:33:25,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134344802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:33:25,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:33:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:33:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982318588] [2025-03-20 01:33:25,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:33:25,297 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:33:25,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:33:25,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:33:25,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:33:25,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:25,298 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:33:25,298 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 4 states have internal predecessors, (461), 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-03-20 01:33:25,298 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:25,298 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:33:25,298 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:32,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:32,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:33:32,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:33:32,766 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-03-20 01:33:32,766 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:33:32,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:33:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -50136551, now seen corresponding path program 1 times [2025-03-20 01:33:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:33:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427341369] [2025-03-20 01:33:32,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:33:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:33:32,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-20 01:33:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-20 01:33:32,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:33:32,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:33:32,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:33:32,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-20 01:33:32,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-20 01:33:32,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:33:32,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:33:32,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:33:32,938 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:33:32,938 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:33:32,938 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:33:32,938 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-03-20 01:33:32,940 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:33:32,941 WARN L247 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:33:32,941 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-03-20 01:33:32,999 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2025-03-20 01:33:33,002 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:33:33,042 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:33:33,042 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:33:33,042 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:33:33,042 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:33:42,953 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:33:42,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:33:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2064291018, now seen corresponding path program 1 times [2025-03-20 01:33:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:33:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730097584] [2025-03-20 01:33:42,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:33:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:33:42,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-20 01:33:42,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-20 01:33:42,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:33:42,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:33:43,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-03-20 01:33:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:33:43,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730097584] [2025-03-20 01:33:43,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730097584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:33:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:33:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:33:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597945734] [2025-03-20 01:33:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:33:43,005 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:33:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:33:43,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:33:43,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:33:43,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:33:43,005 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:33:43,006 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 93.5) internal successors, (187), 2 states have internal predecessors, (187), 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-03-20 01:33:43,006 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:07,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:07,824 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-03-20 01:34:07,824 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:34:07,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:34:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1961553288, now seen corresponding path program 1 times [2025-03-20 01:34:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:34:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346119443] [2025-03-20 01:34:07,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:34:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:34:07,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-20 01:34:07,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-20 01:34:07,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:34:07,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:34:08,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:34:08,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:34:08,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346119443] [2025-03-20 01:34:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346119443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:34:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:34:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:34:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374575071] [2025-03-20 01:34:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:34:08,071 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:34:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:34:08,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:34:08,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:34:08,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:08,072 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:34:08,072 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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-03-20 01:34:08,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:08,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:09,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:09,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:34:09,441 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-03-20 01:34:09,441 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:34:09,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:34:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1169340744, now seen corresponding path program 2 times [2025-03-20 01:34:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:34:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76722709] [2025-03-20 01:34:09,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:34:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:34:09,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 531 statements into 1 equivalence classes. [2025-03-20 01:34:09,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-20 01:34:09,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:34:09,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:34:10,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-03-20 01:34:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:34:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76722709] [2025-03-20 01:34:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76722709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:34:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:34:10,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:34:10,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169518950] [2025-03-20 01:34:10,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:34:10,014 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:34:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:34:10,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:34:10,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:34:10,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:10,015 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:34:10,015 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 4 states have internal predecessors, (478), 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-03-20 01:34:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:34:10,015 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:18,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:18,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:34:18,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:34:18,658 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-03-20 01:34:18,658 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:34:18,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:34:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash -905192234, now seen corresponding path program 1 times [2025-03-20 01:34:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:34:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854776450] [2025-03-20 01:34:18,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:34:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:34:18,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-20 01:34:18,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-20 01:34:18,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:34:18,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:34:18,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:34:18,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-20 01:34:18,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-20 01:34:18,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:34:18,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:34:18,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:34:18,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:34:18,837 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:34:18,838 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:34:18,838 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-03-20 01:34:18,840 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:34:18,840 WARN L247 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:34:18,840 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-03-20 01:34:18,903 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2025-03-20 01:34:18,906 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:34:18,962 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:34:18,963 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:34:18,964 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:34:18,964 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:34:29,349 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:34:29,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:34:29,349 INFO L85 PathProgramCache]: Analyzing trace with hash 516595014, now seen corresponding path program 1 times [2025-03-20 01:34:29,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:34:29,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712355894] [2025-03-20 01:34:29,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:34:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:34:29,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-20 01:34:29,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-20 01:34:29,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:34:29,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:34:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:34:29,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:34:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712355894] [2025-03-20 01:34:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712355894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:34:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:34:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:34:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21621284] [2025-03-20 01:34:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:34:29,402 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:34:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:34:29,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:34:29,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:34:29,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:29,403 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:34:29,403 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 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-03-20 01:34:29,403 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:55,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:55,585 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-03-20 01:34:55,585 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:34:55,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:34:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1235314885, now seen corresponding path program 1 times [2025-03-20 01:34:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:34:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374133659] [2025-03-20 01:34:55,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:34:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:34:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes. [2025-03-20 01:34:55,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-03-20 01:34:55,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:34:55,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:34:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:34:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:34:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374133659] [2025-03-20 01:34:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374133659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:34:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:34:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:34:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328769608] [2025-03-20 01:34:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:34:55,982 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:34:55,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:34:55,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:34:55,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:34:55,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:55,983 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:34:55,983 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-03-20 01:34:55,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:55,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:57,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:57,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:34:57,354 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-03-20 01:34:57,355 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:34:57,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:34:57,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1209451633, now seen corresponding path program 2 times [2025-03-20 01:34:57,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:34:57,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36505700] [2025-03-20 01:34:57,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:34:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:34:57,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 550 statements into 1 equivalence classes. [2025-03-20 01:34:57,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 550 of 550 statements. [2025-03-20 01:34:57,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:34:57,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:34:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:34:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:34:57,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36505700] [2025-03-20 01:34:57,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36505700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:34:57,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:34:57,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:34:57,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781277273] [2025-03-20 01:34:57,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:34:57,941 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:34:57,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:34:57,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:34:57,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:34:57,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:57,941 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:34:57,941 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 4 states have internal predecessors, (495), 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-03-20 01:34:57,942 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:34:57,942 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:34:57,942 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:07,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:07,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:35:07,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:35:07,412 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-03-20 01:35:07,412 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:35:07,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:35:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -706286049, now seen corresponding path program 1 times [2025-03-20 01:35:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:35:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287188309] [2025-03-20 01:35:07,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:35:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:35:07,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-20 01:35:07,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-20 01:35:07,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:35:07,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:35:07,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:35:07,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-20 01:35:07,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-20 01:35:07,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:35:07,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:35:07,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:35:07,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:35:07,611 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:35:07,612 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:35:07,612 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-03-20 01:35:07,614 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:35:07,614 WARN L247 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:35:07,614 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-03-20 01:35:07,674 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2025-03-20 01:35:07,677 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:35:07,719 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:35:07,719 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:35:07,719 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:35:07,719 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:35:18,482 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:35:18,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:35:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash -532618798, now seen corresponding path program 1 times [2025-03-20 01:35:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:35:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939385043] [2025-03-20 01:35:18,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:35:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:35:18,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-20 01:35:18,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-20 01:35:18,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:35:18,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:35:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:35:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:35:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939385043] [2025-03-20 01:35:18,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939385043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:35:18,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:35:18,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:35:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844815069] [2025-03-20 01:35:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:35:18,536 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:35:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:35:18,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:35:18,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:35:18,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:18,536 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:35:18,536 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 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-03-20 01:35:18,536 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:45,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:45,587 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-03-20 01:35:45,587 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:35:45,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:35:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash 492520080, now seen corresponding path program 1 times [2025-03-20 01:35:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:35:45,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607868186] [2025-03-20 01:35:45,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:35:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:35:45,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-20 01:35:45,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-20 01:35:45,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:35:45,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:35:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:35:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:35:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607868186] [2025-03-20 01:35:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607868186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:35:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:35:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:35:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60594451] [2025-03-20 01:35:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:35:45,856 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:35:45,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:35:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:35:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:35:45,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:45,857 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:35:45,857 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-03-20 01:35:45,857 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:45,857 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:47,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:47,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:35:47,016 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-03-20 01:35:47,016 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:35:47,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:35:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1125540746, now seen corresponding path program 2 times [2025-03-20 01:35:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:35:47,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797016560] [2025-03-20 01:35:47,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:35:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:35:47,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 569 statements into 1 equivalence classes. [2025-03-20 01:35:47,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-20 01:35:47,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:35:47,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:35:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:35:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:35:47,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797016560] [2025-03-20 01:35:47,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797016560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:35:47,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:35:47,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:35:47,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869262826] [2025-03-20 01:35:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:35:47,700 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:35:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:35:47,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:35:47,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:35:47,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:47,701 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:35:47,701 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 4 states have internal predecessors, (512), 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-03-20 01:35:47,701 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:47,701 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:35:47,701 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:56,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:35:56,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:35:56,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:35:56,417 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-03-20 01:35:56,417 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:35:56,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:35:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1154551902, now seen corresponding path program 1 times [2025-03-20 01:35:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:35:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678810662] [2025-03-20 01:35:56,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:35:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:35:56,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-20 01:35:56,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-20 01:35:56,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:35:56,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:35:56,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:35:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-20 01:35:56,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-20 01:35:56,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:35:56,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:35:56,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:35:56,614 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:35:56,615 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:35:56,615 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:35:56,615 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-03-20 01:35:56,617 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:35:56,617 WARN L247 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:35:56,617 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2025-03-20 01:35:56,676 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2025-03-20 01:35:56,679 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:35:56,721 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:35:56,721 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:35:56,722 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:35:56,722 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:36:08,367 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:36:08,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:36:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1567196096, now seen corresponding path program 1 times [2025-03-20 01:36:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:36:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134625994] [2025-03-20 01:36:08,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:36:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:36:08,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-20 01:36:08,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-20 01:36:08,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:36:08,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:36:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:36:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:36:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134625994] [2025-03-20 01:36:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134625994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:36:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:36:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:36:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264493030] [2025-03-20 01:36:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:36:08,422 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:36:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:36:08,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:36:08,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:36:08,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:08,422 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:36:08,422 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 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-03-20 01:36:08,422 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:37,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:37,980 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-03-20 01:36:37,980 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:36:37,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:36:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 861800562, now seen corresponding path program 1 times [2025-03-20 01:36:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:36:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277459815] [2025-03-20 01:36:37,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:36:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:36:38,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-20 01:36:38,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-20 01:36:38,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:36:38,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:36:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:36:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:36:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277459815] [2025-03-20 01:36:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277459815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:36:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:36:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:36:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501585368] [2025-03-20 01:36:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:36:38,470 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:36:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:36:38,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:36:38,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:36:38,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:38,471 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:36:38,471 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-03-20 01:36:38,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:38,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:39,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:39,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:36:39,880 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-03-20 01:36:39,881 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:36:39,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:36:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1044448282, now seen corresponding path program 2 times [2025-03-20 01:36:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:36:39,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934072643] [2025-03-20 01:36:39,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:36:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:36:39,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 588 statements into 1 equivalence classes. [2025-03-20 01:36:40,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-20 01:36:40,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:36:40,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:36:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:36:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:36:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934072643] [2025-03-20 01:36:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934072643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:36:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:36:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:36:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035727640] [2025-03-20 01:36:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:36:40,484 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:36:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:36:40,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:36:40,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:36:40,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:40,484 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:36:40,485 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 4 states have internal predecessors, (529), 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-03-20 01:36:40,485 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:40,485 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:36:40,485 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:50,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:36:50,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:36:50,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:36:50,179 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-03-20 01:36:50,179 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:36:50,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:36:50,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1063702271, now seen corresponding path program 1 times [2025-03-20 01:36:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:36:50,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557871130] [2025-03-20 01:36:50,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:36:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:36:50,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-20 01:36:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-20 01:36:50,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:36:50,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:36:50,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:36:50,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-20 01:36:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-20 01:36:50,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:36:50,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:36:50,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:36:50,385 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:36:50,385 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:36:50,385 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:36:50,385 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-03-20 01:36:50,387 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:36:50,388 WARN L247 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:36:50,388 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2025-03-20 01:36:50,445 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2025-03-20 01:36:50,449 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:36:50,500 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:36:50,501 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:36:50,501 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:36:50,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:37:03,075 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:37:03,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:37:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2099005831, now seen corresponding path program 1 times [2025-03-20 01:37:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:37:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490758397] [2025-03-20 01:37:03,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:37:03,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:37:03,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-20 01:37:03,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-20 01:37:03,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:37:03,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:37:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:37:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:37:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490758397] [2025-03-20 01:37:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490758397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:37:03,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:37:03,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:37:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983133151] [2025-03-20 01:37:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:37:03,135 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:37:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:37:03,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:37:03,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:37:03,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:03,135 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:37:03,135 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 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-03-20 01:37:03,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:33,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:33,545 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-03-20 01:37:33,545 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:37:33,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:37:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -31062764, now seen corresponding path program 1 times [2025-03-20 01:37:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:37:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231466433] [2025-03-20 01:37:33,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:37:33,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:37:33,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-20 01:37:33,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-20 01:37:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:37:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:37:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:37:33,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:37:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231466433] [2025-03-20 01:37:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231466433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:37:33,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:37:33,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:37:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313612452] [2025-03-20 01:37:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:37:33,931 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:37:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:37:33,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:37:33,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:37:33,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:33,932 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:37:33,932 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:37:33,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:33,932 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:35,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:35,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:37:35,131 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-03-20 01:37:35,131 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:37:35,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:37:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash -860651394, now seen corresponding path program 2 times [2025-03-20 01:37:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:37:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831972327] [2025-03-20 01:37:35,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:37:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:37:35,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 607 statements into 1 equivalence classes. [2025-03-20 01:37:35,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-20 01:37:35,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:37:35,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:37:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:37:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:37:35,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831972327] [2025-03-20 01:37:35,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831972327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:37:35,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:37:35,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:37:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302787204] [2025-03-20 01:37:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:37:35,753 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:37:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:37:35,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:37:35,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:37:35,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:35,753 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:37:35,753 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 01:37:35,753 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:35,753 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:37:35,753 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:46,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:37:46,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:37:46,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:37:46,550 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-03-20 01:37:46,550 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:37:46,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:37:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash 848105075, now seen corresponding path program 1 times [2025-03-20 01:37:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:37:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87978939] [2025-03-20 01:37:46,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:37:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:37:46,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-20 01:37:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-20 01:37:46,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:37:46,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:37:46,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:37:46,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-20 01:37:46,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-20 01:37:46,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:37:46,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:37:46,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:37:46,776 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:37:46,776 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:37:46,776 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:37:46,776 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-03-20 01:37:46,778 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:37:46,778 WARN L247 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:37:46,778 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2025-03-20 01:37:46,844 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2025-03-20 01:37:46,847 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:37:46,890 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:37:46,890 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:37:46,890 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:37:46,890 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:38:00,025 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:38:00,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:38:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash 597198466, now seen corresponding path program 1 times [2025-03-20 01:38:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:38:00,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798986991] [2025-03-20 01:38:00,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:38:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:38:00,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-20 01:38:00,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-20 01:38:00,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:38:00,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:38:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:38:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:38:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798986991] [2025-03-20 01:38:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798986991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:38:00,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:38:00,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:38:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146390195] [2025-03-20 01:38:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:38:00,089 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:38:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:38:00,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:38:00,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:38:00,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:00,089 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:38:00,089 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 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-03-20 01:38:00,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:32,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:32,759 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-03-20 01:38:32,759 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:38:32,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:38:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash 458771610, now seen corresponding path program 1 times [2025-03-20 01:38:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:38:32,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135256091] [2025-03-20 01:38:32,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:38:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:38:32,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-20 01:38:32,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-20 01:38:32,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:38:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:38:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:38:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:38:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135256091] [2025-03-20 01:38:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135256091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:38:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:38:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 01:38:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352341665] [2025-03-20 01:38:33,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:38:33,089 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 01:38:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:38:33,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 01:38:33,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 01:38:33,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:33,090 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:38:33,090 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 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-03-20 01:38:33,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:33,090 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:34,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:34,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:38:34,328 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-03-20 01:38:34,328 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:38:34,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:38:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -642551128, now seen corresponding path program 2 times [2025-03-20 01:38:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:38:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010254936] [2025-03-20 01:38:34,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 01:38:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:38:34,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 626 statements into 1 equivalence classes. [2025-03-20 01:38:34,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-20 01:38:34,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 01:38:34,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:38:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:38:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:38:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010254936] [2025-03-20 01:38:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010254936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:38:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:38:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 01:38:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673619694] [2025-03-20 01:38:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:38:35,498 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 01:38:35,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:38:35,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 01:38:35,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-20 01:38:35,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:35,499 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:38:35,499 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 4 states have internal predecessors, (563), 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-03-20 01:38:35,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:35,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:38:35,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:46,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:38:46,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 01:38:46,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 01:38:46,820 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-03-20 01:38:46,820 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:38:46,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:38:46,820 INFO L85 PathProgramCache]: Analyzing trace with hash -339222845, now seen corresponding path program 1 times [2025-03-20 01:38:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:38:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707493258] [2025-03-20 01:38:46,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:38:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:38:46,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-20 01:38:46,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-20 01:38:46,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:38:46,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:38:46,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 01:38:46,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-20 01:38:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-20 01:38:46,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:38:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 01:38:47,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 01:38:47,062 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 01:38:47,063 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-20 01:38:47,063 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-20 01:38:47,063 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-03-20 01:38:47,065 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-03-20 01:38:47,065 WARN L247 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 01:38:47,065 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2025-03-20 01:38:47,124 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2025-03-20 01:38:47,127 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:38:47,172 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 01:38:47,173 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 01:38:47,173 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;@5a0b507d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 01:38:47,173 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-20 01:39:01,882 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-20 01:39:01,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 01:39:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -808454156, now seen corresponding path program 1 times [2025-03-20 01:39:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 01:39:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674659868] [2025-03-20 01:39:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 01:39:01,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 01:39:01,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-20 01:39:01,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-20 01:39:01,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 01:39:01,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 01:39:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 01:39:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 01:39:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674659868] [2025-03-20 01:39:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674659868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 01:39:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 01:39:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 01:39:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801187307] [2025-03-20 01:39:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 01:39:01,947 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 01:39:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 01:39:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 01:39:01,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 01:39:01,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 01:39:01,948 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 01:39:01,948 INFO L481 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-03-20 01:39:01,948 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15