./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 09:40:12,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 09:40:12,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 09:40:12,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 09:40:12,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 09:40:12,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 09:40:12,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 09:40:12,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 09:40:12,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 09:40:12,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 09:40:12,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 09:40:12,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 09:40:12,984 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 09:40:12,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 09:40:12,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 09:40:12,985 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 09:40:12,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 09:40:12,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 09:40:12,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 09:40:12,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 09:40:12,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 09:40:12,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 09:40:12,988 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 09:40:12,989 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 09:40:12,989 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-jdk21/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 -> b4439281d7e12bca3fd2bd39ebda4196e341f38fedf1c370a96bdabb4944cfe7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-01-23 09:40:13,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 09:40:13,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 09:40:13,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 09:40:13,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 09:40:13,329 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 09:40:13,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i [2025-01-23 09:40:14,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/fe5708ec2/9790bd79a1a048e6a086dfa8e68edaa4/FLAGbada9578b [2025-01-23 09:40:14,916 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 09:40:14,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i [2025-01-23 09:40:14,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/fe5708ec2/9790bd79a1a048e6a086dfa8e68edaa4/FLAGbada9578b [2025-01-23 09:40:15,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/fe5708ec2/9790bd79a1a048e6a086dfa8e68edaa4 [2025-01-23 09:40:15,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 09:40:15,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 09:40:15,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 09:40:15,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 09:40:15,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 09:40:15,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67d5c681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15, skipping insertion in model container [2025-01-23 09:40:15,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 09:40:15,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2025-01-23 09:40:15,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 09:40:15,594 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 09:40:15,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2025-01-23 09:40:15,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 09:40:15,761 INFO L204 MainTranslator]: Completed translation [2025-01-23 09:40:15,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15 WrapperNode [2025-01-23 09:40:15,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 09:40:15,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 09:40:15,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 09:40:15,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 09:40:15,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,796 INFO L138 Inliner]: procedures = 271, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 135 [2025-01-23 09:40:15,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 09:40:15,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 09:40:15,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 09:40:15,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 09:40:15,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 09:40:15,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 09:40:15,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 09:40:15,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 09:40:15,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (1/1) ... [2025-01-23 09:40:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 09:40:15,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 09:40:15,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 09:40:15,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 09:40:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-23 09:40:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 09:40:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 09:40:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 09:40:15,888 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 09:40:16,017 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 09:40:16,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 09:40:16,248 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 09:40:16,248 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 09:40:16,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 09:40:16,501 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-23 09:40:16,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:40:16 BoogieIcfgContainer [2025-01-23 09:40:16,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 09:40:16,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 09:40:16,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 09:40:16,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 09:40:16,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 09:40:15" (1/3) ... [2025-01-23 09:40:16,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef46975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 09:40:16, skipping insertion in model container [2025-01-23 09:40:16,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:40:15" (2/3) ... [2025-01-23 09:40:16,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef46975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 09:40:16, skipping insertion in model container [2025-01-23 09:40:16,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:40:16" (3/3) ... [2025-01-23 09:40:16,511 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2025-01-23 09:40:16,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 09:40:16,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_08-cond_racefree.i that has 2 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-23 09:40:16,524 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 09:40:16,560 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-23 09:40:16,614 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:16,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 09:40:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 09:40:16,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 09:40:16,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 09:40:16,708 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:16,718 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:16,725 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:16,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:16,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1456407283, now seen corresponding path program 1 times [2025-01-23 09:40:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:16,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902078795] [2025-01-23 09:40:16,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:17,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-23 09:40:17,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-23 09:40:17,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:17,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902078795] [2025-01-23 09:40:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902078795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:17,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:17,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772251101] [2025-01-23 09:40:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:17,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:17,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:17,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:17,179 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:17,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:17,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:17,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 09:40:17,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -65523983, now seen corresponding path program 1 times [2025-01-23 09:40:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349848071] [2025-01-23 09:40:17,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:17,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-23 09:40:17,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-23 09:40:17,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:17,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:17,345 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-23 09:40:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-23 09:40:17,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:17,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:17,393 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:17,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:17,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:17,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 09:40:17,402 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-23 09:40:17,405 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:17,405 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 09:40:17,425 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-23 09:40:17,428 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:17,435 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:17,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:17,435 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:17,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:17,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:17,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1312435456, now seen corresponding path program 1 times [2025-01-23 09:40:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885685673] [2025-01-23 09:40:17,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:17,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 09:40:17,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 09:40:17,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:17,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:17,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885685673] [2025-01-23 09:40:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885685673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447165167] [2025-01-23 09:40:17,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:17,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:17,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:17,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:17,736 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:17,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:17,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 09:40:18,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:18,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 317393046, now seen corresponding path program 1 times [2025-01-23 09:40:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035179881] [2025-01-23 09:40:18,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:18,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:18,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-23 09:40:18,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-23 09:40:18,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:18,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-01-23 09:40:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:18,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035179881] [2025-01-23 09:40:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035179881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:18,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394374403] [2025-01-23 09:40:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:18,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:18,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:18,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,354 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:18,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:18,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 09:40:18,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1358941139, now seen corresponding path program 1 times [2025-01-23 09:40:18,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:18,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987182929] [2025-01-23 09:40:18,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:18,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 09:40:18,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 09:40:18,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:18,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987182929] [2025-01-23 09:40:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987182929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462095400] [2025-01-23 09:40:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:18,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:18,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,763 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:18,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:18,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:18,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 09:40:18,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash -445514798, now seen corresponding path program 1 times [2025-01-23 09:40:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122879388] [2025-01-23 09:40:18,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:18,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-23 09:40:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-23 09:40:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:18,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:18,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-23 09:40:18,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-23 09:40:18,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:18,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:18,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:18,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:18,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:18,942 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 09:40:18,944 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:18,947 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:18,947 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-23 09:40:18,975 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-23 09:40:18,979 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:18,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:18,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:18,989 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:18,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:19,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:19,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:19,338 INFO L85 PathProgramCache]: Analyzing trace with hash -874301604, now seen corresponding path program 1 times [2025-01-23 09:40:19,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:19,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846450087] [2025-01-23 09:40:19,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:19,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:19,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 09:40:19,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 09:40:19,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:19,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:19,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846450087] [2025-01-23 09:40:19,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846450087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:19,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:19,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225517164] [2025-01-23 09:40:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:19,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:19,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:19,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:19,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:19,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:19,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 09:40:20,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1359707624, now seen corresponding path program 1 times [2025-01-23 09:40:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276565981] [2025-01-23 09:40:20,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:20,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-23 09:40:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-23 09:40:20,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:20,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276565981] [2025-01-23 09:40:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276565981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:20,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755744619] [2025-01-23 09:40:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:20,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:20,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,286 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:20,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:20,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 09:40:20,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 88948587, now seen corresponding path program 1 times [2025-01-23 09:40:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510524635] [2025-01-23 09:40:20,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-23 09:40:20,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-23 09:40:20,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:20,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510524635] [2025-01-23 09:40:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510524635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048202353] [2025-01-23 09:40:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:20,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:20,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:20,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,674 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:20,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 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-01-23 09:40:20,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:20,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:20,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 09:40:20,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:20,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:20,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1874908768, now seen corresponding path program 1 times [2025-01-23 09:40:20,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:20,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212542912] [2025-01-23 09:40:20,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:20,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 09:40:20,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 09:40:20,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:20,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:20,915 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:20,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-23 09:40:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-23 09:40:20,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:20,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:20,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:20,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:20,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:20,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:20,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-23 09:40:20,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:20,950 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:20,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-23 09:40:20,976 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-23 09:40:20,979 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:20,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:20,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:20,989 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:20,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:21,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:21,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1283869178, now seen corresponding path program 1 times [2025-01-23 09:40:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:21,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209715189] [2025-01-23 09:40:21,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:21,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-23 09:40:21,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 09:40:21,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:21,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:21,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-01-23 09:40:21,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:21,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209715189] [2025-01-23 09:40:21,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209715189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:21,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:21,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:21,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119077175] [2025-01-23 09:40:21,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:21,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:21,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:21,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:21,498 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:21,499 INFO L472 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-01-23 09:40:21,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:22,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-23 09:40:22,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1213618707, now seen corresponding path program 1 times [2025-01-23 09:40:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:22,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354611325] [2025-01-23 09:40:22,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:22,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:22,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-23 09:40:22,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-23 09:40:22,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:22,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354611325] [2025-01-23 09:40:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354611325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592479129] [2025-01-23 09:40:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:22,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:22,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:22,845 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:22,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:22,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:22,846 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:23,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-23 09:40:23,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:23,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:23,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1460339545, now seen corresponding path program 1 times [2025-01-23 09:40:23,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:23,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411857715] [2025-01-23 09:40:23,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:23,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:23,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-23 09:40:23,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 09:40:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:23,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411857715] [2025-01-23 09:40:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411857715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:23,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848165626] [2025-01-23 09:40:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:23,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:40:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:23,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:40:23,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:40:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:23,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:23,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:23,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:23,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:23,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:23,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-23 09:40:23,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1836622360, now seen corresponding path program 1 times [2025-01-23 09:40:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826889944] [2025-01-23 09:40:23,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-23 09:40:23,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-23 09:40:23,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:23,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:23,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:23,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-23 09:40:23,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-23 09:40:23,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:23,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:23,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:23,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:23,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:23,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:23,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-23 09:40:23,548 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:23,549 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:23,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-23 09:40:23,577 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-23 09:40:23,579 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:23,589 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:23,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:23,590 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:23,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:24,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:24,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash -455200051, now seen corresponding path program 1 times [2025-01-23 09:40:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886340972] [2025-01-23 09:40:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:24,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-23 09:40:24,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 09:40:24,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:24,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886340972] [2025-01-23 09:40:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886340972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:24,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572849111] [2025-01-23 09:40:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:24,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:24,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:24,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:24,198 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:24,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:25,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-23 09:40:25,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1278917649, now seen corresponding path program 1 times [2025-01-23 09:40:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764949281] [2025-01-23 09:40:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-23 09:40:25,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-23 09:40:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764949281] [2025-01-23 09:40:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764949281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:25,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:25,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952473204] [2025-01-23 09:40:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:25,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:25,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:25,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:25,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:25,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:25,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:25,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:26,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-23 09:40:26,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:26,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 482288670, now seen corresponding path program 1 times [2025-01-23 09:40:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626212283] [2025-01-23 09:40:26,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:26,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-23 09:40:26,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-23 09:40:26,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:26,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626212283] [2025-01-23 09:40:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626212283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:26,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200554116] [2025-01-23 09:40:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:26,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:26,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:26,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:26,487 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:26,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:26,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:26,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:26,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:26,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-23 09:40:26,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:26,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1967884845, now seen corresponding path program 1 times [2025-01-23 09:40:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234079808] [2025-01-23 09:40:26,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:26,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 09:40:26,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 09:40:26,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:26,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:26,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:26,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 09:40:26,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 09:40:26,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:26,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:26,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:26,851 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:26,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:26,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:26,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-23 09:40:26,853 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:26,853 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:26,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-23 09:40:26,878 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-01-23 09:40:26,880 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:26,895 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:26,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:26,896 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:26,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:27,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:27,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash 972609476, now seen corresponding path program 1 times [2025-01-23 09:40:27,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:27,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976837491] [2025-01-23 09:40:27,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:27,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:27,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-23 09:40:27,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-23 09:40:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:27,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976837491] [2025-01-23 09:40:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976837491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:27,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114100767] [2025-01-23 09:40:27,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:27,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:27,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:27,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:27,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:27,618 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:27,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:27,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-23 09:40:29,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash -2051671819, now seen corresponding path program 1 times [2025-01-23 09:40:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891725738] [2025-01-23 09:40:29,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:29,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-23 09:40:29,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-23 09:40:29,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:29,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891725738] [2025-01-23 09:40:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891725738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383848547] [2025-01-23 09:40:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:29,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:29,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:29,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:29,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:29,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:29,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:29,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-23 09:40:29,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:29,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:29,895 INFO L85 PathProgramCache]: Analyzing trace with hash 289964129, now seen corresponding path program 1 times [2025-01-23 09:40:29,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:29,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784259907] [2025-01-23 09:40:29,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:29,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-23 09:40:29,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-23 09:40:29,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:29,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784259907] [2025-01-23 09:40:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784259907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:30,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:30,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382683421] [2025-01-23 09:40:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:30,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:30,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:30,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:30,110 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:30,111 INFO L472 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-01-23 09:40:30,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:30,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:30,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:30,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-23 09:40:30,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:30,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1042251666, now seen corresponding path program 1 times [2025-01-23 09:40:30,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263289965] [2025-01-23 09:40:30,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:30,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-23 09:40:30,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-23 09:40:30,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:30,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:30,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:30,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-23 09:40:30,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-23 09:40:30,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:30,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:30,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:30,710 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:30,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:30,711 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:30,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-23 09:40:30,713 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:30,714 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:30,714 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-01-23 09:40:30,739 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-01-23 09:40:30,743 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:30,757 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:30,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:30,759 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:30,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:31,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 89368410, now seen corresponding path program 1 times [2025-01-23 09:40:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173924938] [2025-01-23 09:40:31,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:31,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-23 09:40:31,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-23 09:40:31,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:31,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173924938] [2025-01-23 09:40:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173924938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131308197] [2025-01-23 09:40:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:31,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:31,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:31,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:31,701 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:31,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:31,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-23 09:40:34,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:34,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1569621394, now seen corresponding path program 1 times [2025-01-23 09:40:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:34,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987855191] [2025-01-23 09:40:34,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:34,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-23 09:40:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 09:40:34,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:34,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-01-23 09:40:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987855191] [2025-01-23 09:40:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987855191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859311884] [2025-01-23 09:40:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:34,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:34,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,221 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:34,221 INFO L472 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-01-23 09:40:34,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-23 09:40:34,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1573785847, now seen corresponding path program 1 times [2025-01-23 09:40:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732087291] [2025-01-23 09:40:34,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:34,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-23 09:40:34,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-23 09:40:34,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:34,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:34,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732087291] [2025-01-23 09:40:34,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732087291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:34,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:34,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:34,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344870700] [2025-01-23 09:40:34,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:34,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:34,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:34,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:34,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,922 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:34,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:34,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:34,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:34,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:35,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-23 09:40:35,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:35,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -553969545, now seen corresponding path program 1 times [2025-01-23 09:40:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613353116] [2025-01-23 09:40:35,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:35,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-23 09:40:35,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-23 09:40:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:35,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:35,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-23 09:40:35,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-23 09:40:35,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:35,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:35,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:35,548 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:35,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:35,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:35,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-23 09:40:35,549 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:35,550 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:35,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-01-23 09:40:35,576 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-23 09:40:35,578 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:35,593 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:35,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:35,594 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:35,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:36,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1039933082, now seen corresponding path program 1 times [2025-01-23 09:40:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:36,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386741921] [2025-01-23 09:40:36,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:36,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-23 09:40:36,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-23 09:40:36,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:36,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:36,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386741921] [2025-01-23 09:40:36,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386741921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:36,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:36,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:36,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315217604] [2025-01-23 09:40:36,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:36,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:36,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:36,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:36,731 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:36,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:39,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-23 09:40:39,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1455762115, now seen corresponding path program 1 times [2025-01-23 09:40:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145417172] [2025-01-23 09:40:39,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:39,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-23 09:40:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-23 09:40:39,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:39,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:39,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-01-23 09:40:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145417172] [2025-01-23 09:40:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145417172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950183513] [2025-01-23 09:40:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:39,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:39,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:39,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:39,659 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:39,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:39,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:39,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:40,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-23 09:40:40,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -773528882, now seen corresponding path program 1 times [2025-01-23 09:40:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107933540] [2025-01-23 09:40:40,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:40,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-23 09:40:40,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-23 09:40:40,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:40,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107933540] [2025-01-23 09:40:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107933540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:40,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924640735] [2025-01-23 09:40:40,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:40,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:40,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:40,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:40,407 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:40,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:40,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:40,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:40,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:41,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-23 09:40:41,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:41,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash -346705467, now seen corresponding path program 1 times [2025-01-23 09:40:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187002299] [2025-01-23 09:40:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:41,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-23 09:40:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-23 09:40:41,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:41,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:41,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:41,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-23 09:40:41,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-23 09:40:41,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:41,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:41,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:41,115 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:41,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:41,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-23 09:40:41,117 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:41,117 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:41,117 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-01-23 09:40:41,145 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-01-23 09:40:41,151 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:41,169 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:41,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:41,170 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:41,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:42,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:42,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -675971885, now seen corresponding path program 1 times [2025-01-23 09:40:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:42,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641677772] [2025-01-23 09:40:42,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:42,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-23 09:40:42,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-23 09:40:42,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:42,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641677772] [2025-01-23 09:40:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641677772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905869558] [2025-01-23 09:40:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:42,339 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:42,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:45,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-23 09:40:45,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1473611197, now seen corresponding path program 1 times [2025-01-23 09:40:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419602327] [2025-01-23 09:40:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:45,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-23 09:40:45,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-23 09:40:45,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:45,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:45,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419602327] [2025-01-23 09:40:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419602327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:45,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:45,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639418332] [2025-01-23 09:40:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:45,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:45,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:45,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:45,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:45,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:45,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:46,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-23 09:40:46,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2044658336, now seen corresponding path program 1 times [2025-01-23 09:40:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641995934] [2025-01-23 09:40:46,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:46,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-23 09:40:46,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-23 09:40:46,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:46,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641995934] [2025-01-23 09:40:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641995934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:46,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301944004] [2025-01-23 09:40:46,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:46,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:46,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:46,443 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:46,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:46,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:46,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:46,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:47,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-23 09:40:47,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:47,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 461647577, now seen corresponding path program 1 times [2025-01-23 09:40:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195312607] [2025-01-23 09:40:47,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:47,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-23 09:40:47,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-23 09:40:47,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:47,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:47,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:47,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-23 09:40:47,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-23 09:40:47,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:47,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:47,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:47,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:47,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:47,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-23 09:40:47,458 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:47,458 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:47,458 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-01-23 09:40:47,489 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-01-23 09:40:47,491 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:47,510 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:47,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:47,510 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:47,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:48,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:48,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 554183826, now seen corresponding path program 1 times [2025-01-23 09:40:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901236072] [2025-01-23 09:40:48,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:48,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-23 09:40:48,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-23 09:40:48,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901236072] [2025-01-23 09:40:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901236072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:48,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773141907] [2025-01-23 09:40:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:48,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:48,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:48,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:48,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:48,791 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:48,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:48,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-23 09:40:52,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:52,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1669334971, now seen corresponding path program 1 times [2025-01-23 09:40:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078794554] [2025-01-23 09:40:52,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:52,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-23 09:40:52,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-23 09:40:52,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:52,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:52,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:52,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078794554] [2025-01-23 09:40:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078794554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:52,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:40:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450811050] [2025-01-23 09:40:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:52,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:40:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:52,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:40:52,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:40:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:52,504 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:52,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:52,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:53,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-23 09:40:53,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:53,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -802958831, now seen corresponding path program 1 times [2025-01-23 09:40:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911396709] [2025-01-23 09:40:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:53,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-23 09:40:53,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-23 09:40:53,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:53,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911396709] [2025-01-23 09:40:53,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911396709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:53,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:53,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:40:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844786253] [2025-01-23 09:40:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:53,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:40:53,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:53,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:40:53,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:40:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:53,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:53,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:53,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:53,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:53,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:40:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:40:54,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-23 09:40:54,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:54,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1099416475, now seen corresponding path program 1 times [2025-01-23 09:40:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437212570] [2025-01-23 09:40:54,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:54,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-23 09:40:54,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-23 09:40:54,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:54,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:54,257 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:40:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-23 09:40:54,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-23 09:40:54,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:54,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:40:54,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:40:54,285 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:40:54,285 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:40:54,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:40:54,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-23 09:40:54,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:40:54,287 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:40:54,287 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-01-23 09:40:54,312 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2025-01-23 09:40:54,315 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:54,337 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:40:54,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:40:54,337 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:40:54,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:40:55,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:55,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash 158444360, now seen corresponding path program 1 times [2025-01-23 09:40:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931171021] [2025-01-23 09:40:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:55,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:55,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-23 09:40:55,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-23 09:40:55,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:55,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:40:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:40:55,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:40:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931171021] [2025-01-23 09:40:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931171021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:40:55,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:40:55,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:40:55,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430880733] [2025-01-23 09:40:55,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:40:55,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:40:55,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:40:55,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:40:55,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:40:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:55,838 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:40:55,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:40:55,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:40:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-23 09:40:59,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:40:59,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:40:59,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1180032260, now seen corresponding path program 1 times [2025-01-23 09:40:59,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:40:59,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843722855] [2025-01-23 09:40:59,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:40:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:40:59,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-23 09:40:59,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-23 09:40:59,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:40:59,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843722855] [2025-01-23 09:41:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843722855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877798474] [2025-01-23 09:41:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:41:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:41:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:41:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:00,049 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:00,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:00,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:00,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:00,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-23 09:41:00,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:00,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1419050332, now seen corresponding path program 1 times [2025-01-23 09:41:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171500551] [2025-01-23 09:41:00,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-23 09:41:00,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-23 09:41:00,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:00,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:01,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:01,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171500551] [2025-01-23 09:41:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171500551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:01,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:01,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:41:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123219155] [2025-01-23 09:41:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:01,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:41:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:01,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:41:01,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:41:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:01,052 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:01,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:01,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:01,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:01,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:41:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-23 09:41:02,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:02,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:02,191 INFO L85 PathProgramCache]: Analyzing trace with hash -691641976, now seen corresponding path program 1 times [2025-01-23 09:41:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:02,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545476758] [2025-01-23 09:41:02,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:02,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-23 09:41:02,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-23 09:41:02,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:02,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:02,226 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:41:02,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-23 09:41:02,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-23 09:41:02,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:02,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:02,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:41:02,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:41:02,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:41:02,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:41:02,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-23 09:41:02,264 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:41:02,265 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:41:02,265 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-01-23 09:41:02,298 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-23 09:41:02,300 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:02,323 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:41:02,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:41:02,324 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:02,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:41:04,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:04,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1821317068, now seen corresponding path program 1 times [2025-01-23 09:41:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:04,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962044256] [2025-01-23 09:41:04,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:04,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-23 09:41:04,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-23 09:41:04,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:04,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962044256] [2025-01-23 09:41:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962044256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:04,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:04,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:41:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534605151] [2025-01-23 09:41:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:41:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:04,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:41:04,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:41:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:04,102 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:04,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:04,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:08,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-23 09:41:08,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:08,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash -886956050, now seen corresponding path program 1 times [2025-01-23 09:41:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66402968] [2025-01-23 09:41:08,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:08,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-23 09:41:09,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-23 09:41:09,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:09,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:09,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-01-23 09:41:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:09,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66402968] [2025-01-23 09:41:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66402968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:09,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:09,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967711955] [2025-01-23 09:41:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:41:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:09,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:41:09,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:41:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:09,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:09,075 INFO L472 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-01-23 09:41:09,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:09,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:09,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-23 09:41:09,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:09,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash -700395664, now seen corresponding path program 1 times [2025-01-23 09:41:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022419140] [2025-01-23 09:41:09,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:10,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-23 09:41:10,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-23 09:41:10,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:10,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022419140] [2025-01-23 09:41:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022419140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:10,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628773417] [2025-01-23 09:41:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:10,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:41:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:10,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:41:10,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:41:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:10,385 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:10,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:10,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:10,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:10,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:41:11,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-23 09:41:11,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:11,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1572317323, now seen corresponding path program 1 times [2025-01-23 09:41:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:11,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259227216] [2025-01-23 09:41:11,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:11,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-23 09:41:11,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-23 09:41:11,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:11,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:11,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:41:11,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-23 09:41:11,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-23 09:41:11,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:11,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:11,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:41:11,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:41:11,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:41:11,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:41:11,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-23 09:41:11,841 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:41:11,841 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:41:11,841 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-01-23 09:41:11,878 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-01-23 09:41:11,881 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:11,906 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:41:11,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:41:11,907 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:11,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:41:13,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:13,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1149804461, now seen corresponding path program 1 times [2025-01-23 09:41:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:13,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348955094] [2025-01-23 09:41:13,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:13,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-23 09:41:13,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-23 09:41:13,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:13,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348955094] [2025-01-23 09:41:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348955094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:13,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:41:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116219296] [2025-01-23 09:41:13,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:13,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:41:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:13,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:41:13,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:41:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:13,908 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:13,908 INFO L472 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-01-23 09:41:13,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:19,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-23 09:41:19,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:19,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1796491690, now seen corresponding path program 1 times [2025-01-23 09:41:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:19,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234062996] [2025-01-23 09:41:19,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:19,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:19,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-23 09:41:19,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-23 09:41:19,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234062996] [2025-01-23 09:41:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234062996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001297885] [2025-01-23 09:41:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:19,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:41:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:19,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:41:19,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:41:19,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:19,585 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:19,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:19,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:19,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:20,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-23 09:41:20,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:20,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:20,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2018527819, now seen corresponding path program 1 times [2025-01-23 09:41:20,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:20,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781142429] [2025-01-23 09:41:20,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:20,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:20,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-23 09:41:20,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-23 09:41:20,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:20,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:20,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:20,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:20,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781142429] [2025-01-23 09:41:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781142429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:20,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:20,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494788790] [2025-01-23 09:41:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:20,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:41:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:20,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:41:20,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:41:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:20,862 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:20,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:20,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:20,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:41:22,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-23 09:41:22,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1043461412, now seen corresponding path program 1 times [2025-01-23 09:41:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653172165] [2025-01-23 09:41:22,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:22,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-23 09:41:22,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 09:41:22,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:22,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:22,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:41:22,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-23 09:41:22,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-23 09:41:22,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:22,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:22,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:41:22,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:41:22,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:41:22,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:41:22,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-23 09:41:22,490 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:41:22,490 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:41:22,491 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-01-23 09:41:22,525 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2025-01-23 09:41:22,527 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:22,546 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:41:22,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:41:22,546 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:22,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:41:24,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:24,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash 823918826, now seen corresponding path program 1 times [2025-01-23 09:41:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:24,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100254786] [2025-01-23 09:41:24,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:24,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-23 09:41:24,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-23 09:41:24,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:24,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100254786] [2025-01-23 09:41:24,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100254786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:24,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:24,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:41:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757535129] [2025-01-23 09:41:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:24,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:41:24,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:24,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:41:24,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:41:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:24,862 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:24,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:24,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:31,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-23 09:41:31,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash 669638185, now seen corresponding path program 1 times [2025-01-23 09:41:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:31,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824722263] [2025-01-23 09:41:31,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:31,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-23 09:41:31,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-23 09:41:31,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:31,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:31,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-01-23 09:41:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:31,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824722263] [2025-01-23 09:41:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824722263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:31,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995933057] [2025-01-23 09:41:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:31,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:41:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:31,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:41:31,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:41:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:31,475 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:31,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:31,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:31,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:32,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:32,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-23 09:41:32,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash 462566529, now seen corresponding path program 1 times [2025-01-23 09:41:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:32,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435259113] [2025-01-23 09:41:32,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:32,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-23 09:41:32,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-23 09:41:32,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:32,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:32,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:32,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435259113] [2025-01-23 09:41:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435259113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163061825] [2025-01-23 09:41:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:32,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:41:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:41:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:41:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:32,989 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:32,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:32,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:32,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:32,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:41:35,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-23 09:41:35,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -993877860, now seen corresponding path program 1 times [2025-01-23 09:41:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199508772] [2025-01-23 09:41:35,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:35,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-23 09:41:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-23 09:41:35,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:35,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:41:35,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-23 09:41:35,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-23 09:41:35,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:35,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:35,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:41:35,186 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:41:35,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:41:35,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:41:35,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-23 09:41:35,188 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-23 09:41:35,188 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:41:35,188 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-01-23 09:41:35,226 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2025-01-23 09:41:35,229 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:35,251 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:41:35,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:41:35,251 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:35,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:41:37,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:37,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash -632649930, now seen corresponding path program 1 times [2025-01-23 09:41:37,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:37,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345454684] [2025-01-23 09:41:37,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:37,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-23 09:41:37,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-23 09:41:37,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:37,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345454684] [2025-01-23 09:41:37,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345454684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:41:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038892524] [2025-01-23 09:41:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:41:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:37,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:41:37,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:41:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:37,826 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:37,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:45,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-23 09:41:45,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:45,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2141526174, now seen corresponding path program 1 times [2025-01-23 09:41:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:45,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357051459] [2025-01-23 09:41:45,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:45,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:45,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-23 09:41:45,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-23 09:41:45,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:45,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:45,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357051459] [2025-01-23 09:41:45,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357051459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:45,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:45,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:41:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76416191] [2025-01-23 09:41:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:45,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:41:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:45,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:41:45,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:41:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:45,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:45,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:45,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:45,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:46,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-23 09:41:46,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:46,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:46,396 INFO L85 PathProgramCache]: Analyzing trace with hash 773211562, now seen corresponding path program 2 times [2025-01-23 09:41:46,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:46,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669649219] [2025-01-23 09:41:46,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:41:46,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:46,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 282 statements into 1 equivalence classes. [2025-01-23 09:41:46,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-23 09:41:46,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:41:46,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:46,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:46,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669649219] [2025-01-23 09:41:46,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669649219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:46,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:46,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:41:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374469324] [2025-01-23 09:41:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:46,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:41:46,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:46,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:41:46,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:41:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:46,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:46,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:46,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:46,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:46,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:41:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:41:49,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-23 09:41:49,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:49,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash -880123402, now seen corresponding path program 1 times [2025-01-23 09:41:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:49,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606010409] [2025-01-23 09:41:49,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:49,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-23 09:41:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-23 09:41:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:49,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:41:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-23 09:41:49,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-23 09:41:49,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:49,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:41:49,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:41:49,386 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:41:49,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:41:49,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:41:49,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-23 09:41:49,388 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:41:49,388 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:41:49,388 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-01-23 09:41:49,435 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-01-23 09:41:49,438 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:49,468 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:41:49,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:41:49,468 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:41:49,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:41:52,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:41:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:41:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash 400341740, now seen corresponding path program 1 times [2025-01-23 09:41:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:41:52,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336337090] [2025-01-23 09:41:52,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:41:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:41:52,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-23 09:41:52,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-23 09:41:52,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:41:52,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:41:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:41:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:41:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336337090] [2025-01-23 09:41:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336337090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:41:52,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:41:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:41:52,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633389723] [2025-01-23 09:41:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:41:52,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:41:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:41:52,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:41:52,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:41:52,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:41:52,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:41:52,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:41:52,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:00,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-23 09:42:00,664 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:00,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash -100864702, now seen corresponding path program 1 times [2025-01-23 09:42:00,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:00,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141320350] [2025-01-23 09:42:00,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:00,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-23 09:42:00,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-23 09:42:00,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:00,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141320350] [2025-01-23 09:42:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141320350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:00,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:00,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:42:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024142304] [2025-01-23 09:42:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:00,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:42:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:00,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:42:00,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:42:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:00,802 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:00,803 INFO L472 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-01-23 09:42:00,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:00,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-23 09:42:01,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:01,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash -458267440, now seen corresponding path program 2 times [2025-01-23 09:42:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377025941] [2025-01-23 09:42:01,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:42:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:01,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 302 statements into 1 equivalence classes. [2025-01-23 09:42:01,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-23 09:42:01,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:42:01,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:02,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377025941] [2025-01-23 09:42:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377025941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:42:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841668431] [2025-01-23 09:42:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:02,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:42:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:02,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:42:02,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:42:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:02,313 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:02,313 INFO L472 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-01-23 09:42:02,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:02,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:02,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:05,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:42:05,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-01-23 09:42:05,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:05,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:05,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1117322285, now seen corresponding path program 1 times [2025-01-23 09:42:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:05,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127057021] [2025-01-23 09:42:05,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:05,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-23 09:42:05,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-23 09:42:05,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:05,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:42:05,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:42:05,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-23 09:42:05,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-23 09:42:05,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:05,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:42:05,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:42:05,196 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:42:05,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:42:05,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:42:05,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-01-23 09:42:05,200 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:42:05,200 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:42:05,200 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-01-23 09:42:05,249 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2025-01-23 09:42:05,252 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:42:05,282 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:42:05,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:42:05,283 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:42:05,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:42:08,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1084288687, now seen corresponding path program 1 times [2025-01-23 09:42:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264407828] [2025-01-23 09:42:08,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:08,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-23 09:42:08,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-23 09:42:08,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:08,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264407828] [2025-01-23 09:42:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264407828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:42:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106611805] [2025-01-23 09:42:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:08,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:42:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:08,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:42:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:42:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:08,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:08,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-01-23 09:42:17,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:17,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash -374624585, now seen corresponding path program 1 times [2025-01-23 09:42:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569314936] [2025-01-23 09:42:17,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:17,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-23 09:42:17,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-23 09:42:17,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:17,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:17,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:17,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569314936] [2025-01-23 09:42:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569314936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:17,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:42:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337078479] [2025-01-23 09:42:17,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:17,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:42:17,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:17,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:42:17,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:42:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:17,868 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:17,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:17,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-01-23 09:42:18,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1764868767, now seen corresponding path program 2 times [2025-01-23 09:42:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075939230] [2025-01-23 09:42:18,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:42:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:18,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 322 statements into 1 equivalence classes. [2025-01-23 09:42:18,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-23 09:42:18,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:42:18,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:19,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075939230] [2025-01-23 09:42:19,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075939230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:19,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:19,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:42:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889062053] [2025-01-23 09:42:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:19,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:42:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:19,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:42:19,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:42:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:19,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:19,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:19,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:19,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:19,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:22,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:22,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:22,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:42:22,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-01-23 09:42:22,717 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:22,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1812630991, now seen corresponding path program 1 times [2025-01-23 09:42:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:22,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088126659] [2025-01-23 09:42:22,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:22,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-23 09:42:22,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-23 09:42:22,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:22,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:42:22,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:42:22,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-23 09:42:22,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-23 09:42:22,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:22,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:42:22,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:42:22,918 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:42:22,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:42:22,918 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:42:22,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-01-23 09:42:22,922 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:42:22,922 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:42:22,922 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-01-23 09:42:22,967 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-23 09:42:22,970 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:42:23,006 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:42:23,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:42:23,006 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:42:23,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:42:26,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash -735045266, now seen corresponding path program 1 times [2025-01-23 09:42:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687239553] [2025-01-23 09:42:26,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:26,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-23 09:42:26,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-23 09:42:26,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:26,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687239553] [2025-01-23 09:42:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687239553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:26,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:26,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:42:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326798869] [2025-01-23 09:42:26,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:26,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:42:26,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:26,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:42:26,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:42:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:26,647 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:26,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:26,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:37,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:37,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-01-23 09:42:37,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:37,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1913031067, now seen corresponding path program 1 times [2025-01-23 09:42:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507889250] [2025-01-23 09:42:37,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:37,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-23 09:42:37,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-23 09:42:37,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:37,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:37,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-01-23 09:42:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507889250] [2025-01-23 09:42:37,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507889250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:37,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:37,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:42:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013802673] [2025-01-23 09:42:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:37,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:42:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:37,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:42:37,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:42:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:37,185 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:37,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:37,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:37,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:38,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-01-23 09:42:38,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash 603451813, now seen corresponding path program 2 times [2025-01-23 09:42:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:38,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490036381] [2025-01-23 09:42:38,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:42:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:38,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 342 statements into 1 equivalence classes. [2025-01-23 09:42:38,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-23 09:42:38,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:42:38,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:38,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490036381] [2025-01-23 09:42:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490036381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:42:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823098102] [2025-01-23 09:42:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:42:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:38,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:42:38,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:42:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:38,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:38,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:38,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:38,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:38,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:42:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-01-23 09:42:42,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:42,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 898028324, now seen corresponding path program 1 times [2025-01-23 09:42:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:42,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893827932] [2025-01-23 09:42:42,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:42,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:42,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-23 09:42:42,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-23 09:42:42,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:42:42,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:42:42,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-23 09:42:42,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-23 09:42:42,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:42,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:42:42,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:42:42,515 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:42:42,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:42:42,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:42:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-01-23 09:42:42,517 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:42:42,517 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:42:42,517 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-01-23 09:42:42,566 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2025-01-23 09:42:42,569 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:42:42,600 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:42:42,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:42:42,601 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:42:42,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:42:46,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:46,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash 173878388, now seen corresponding path program 1 times [2025-01-23 09:42:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433141512] [2025-01-23 09:42:46,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:46,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:46,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-23 09:42:46,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-23 09:42:46,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:46,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:46,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:46,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433141512] [2025-01-23 09:42:46,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433141512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:46,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:46,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:42:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111337848] [2025-01-23 09:42:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:42:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:46,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:42:46,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:42:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:46,722 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:46,722 INFO L472 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-01-23 09:42:46,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:58,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-01-23 09:42:58,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:58,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1737577921, now seen corresponding path program 1 times [2025-01-23 09:42:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:58,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161186819] [2025-01-23 09:42:58,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:42:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:58,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-23 09:42:58,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-23 09:42:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:42:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161186819] [2025-01-23 09:42:58,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161186819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:58,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:58,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:42:58,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817486425] [2025-01-23 09:42:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:42:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:58,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:42:58,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:42:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:58,227 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:58,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:58,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:58,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:59,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-01-23 09:42:59,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:42:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:42:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 226853207, now seen corresponding path program 2 times [2025-01-23 09:42:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:42:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885518336] [2025-01-23 09:42:59,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:42:59,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:42:59,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 362 statements into 1 equivalence classes. [2025-01-23 09:42:59,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-23 09:42:59,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:42:59,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:42:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:42:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:42:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885518336] [2025-01-23 09:42:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885518336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:42:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:42:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:42:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126004149] [2025-01-23 09:42:59,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:42:59,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:42:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:42:59,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:42:59,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:42:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:59,779 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:42:59,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:42:59,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:42:59,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:42:59,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:43:03,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-01-23 09:43:03,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:03,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2100185300, now seen corresponding path program 1 times [2025-01-23 09:43:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706596581] [2025-01-23 09:43:03,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:03,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:03,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-23 09:43:03,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-23 09:43:03,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:03,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:43:03,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:43:03,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-23 09:43:03,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-23 09:43:03,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:03,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:43:03,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:43:03,831 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:43:03,831 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:43:03,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:43:03,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-01-23 09:43:03,833 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:43:03,833 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:43:03,833 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-01-23 09:43:03,887 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-01-23 09:43:03,891 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:43:03,925 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:43:03,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:43:03,925 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:43:03,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:43:08,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash 191366874, now seen corresponding path program 1 times [2025-01-23 09:43:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516634388] [2025-01-23 09:43:08,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:08,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-23 09:43:08,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-23 09:43:08,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:08,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:08,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-01-23 09:43:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516634388] [2025-01-23 09:43:08,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516634388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:08,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:08,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:43:08,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072573762] [2025-01-23 09:43:08,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:08,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:43:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:08,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:43:08,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:43:08,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:08,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:08,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:08,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:20,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-01-23 09:43:20,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:20,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1602453598, now seen corresponding path program 1 times [2025-01-23 09:43:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548214016] [2025-01-23 09:43:20,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:20,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-23 09:43:20,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-23 09:43:20,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:20,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:43:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548214016] [2025-01-23 09:43:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548214016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:43:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432286189] [2025-01-23 09:43:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:43:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:20,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:43:20,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:43:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:20,964 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:20,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:20,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-01-23 09:43:22,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:22,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1089577116, now seen corresponding path program 2 times [2025-01-23 09:43:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901108104] [2025-01-23 09:43:22,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:43:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:22,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 382 statements into 1 equivalence classes. [2025-01-23 09:43:22,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-23 09:43:22,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:43:22,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:43:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901108104] [2025-01-23 09:43:22,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901108104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:22,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:43:22,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031351264] [2025-01-23 09:43:22,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:22,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:43:22,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:43:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:43:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:22,920 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:22,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:22,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:22,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:22,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:27,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:27,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:43:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-01-23 09:43:27,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 896725385, now seen corresponding path program 1 times [2025-01-23 09:43:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:27,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084597958] [2025-01-23 09:43:27,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:27,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-23 09:43:27,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-23 09:43:27,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:27,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:43:27,549 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:43:27,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-23 09:43:27,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-23 09:43:27,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:27,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:43:27,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:43:27,616 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:43:27,617 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:43:27,617 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:43:27,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-01-23 09:43:27,619 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:43:27,619 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:43:27,619 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-01-23 09:43:27,676 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-01-23 09:43:27,679 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:43:27,712 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:43:27,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:43:27,713 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:43:27,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:43:32,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1879844013, now seen corresponding path program 1 times [2025-01-23 09:43:32,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722444182] [2025-01-23 09:43:32,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:32,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-23 09:43:32,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-23 09:43:32,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:32,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:43:32,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722444182] [2025-01-23 09:43:32,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722444182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:32,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:32,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:43:32,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669793513] [2025-01-23 09:43:32,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:32,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:43:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:32,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:43:32,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:43:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:32,698 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:32,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:46,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-01-23 09:43:46,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1468455590, now seen corresponding path program 1 times [2025-01-23 09:43:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:46,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442798547] [2025-01-23 09:43:46,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:46,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-23 09:43:46,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-23 09:43:46,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:46,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:43:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:46,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442798547] [2025-01-23 09:43:46,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442798547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:46,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:46,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:43:46,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036671142] [2025-01-23 09:43:46,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:46,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:43:46,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:46,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:43:46,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:43:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:46,215 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:46,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:46,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:46,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:47,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-01-23 09:43:47,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:47,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1190620826, now seen corresponding path program 2 times [2025-01-23 09:43:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:47,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024120545] [2025-01-23 09:43:47,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:43:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:47,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 1 equivalence classes. [2025-01-23 09:43:47,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-23 09:43:47,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:43:47,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:43:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024120545] [2025-01-23 09:43:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024120545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:43:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641410310] [2025-01-23 09:43:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:43:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:47,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:43:47,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:43:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:47,824 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:47,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:47,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:43:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:43:53,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-01-23 09:43:53,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -720903037, now seen corresponding path program 1 times [2025-01-23 09:43:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942223512] [2025-01-23 09:43:53,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:53,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-23 09:43:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-23 09:43:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:43:53,051 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:43:53,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-23 09:43:53,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-23 09:43:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:43:53,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:43:53,127 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:43:53,127 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:43:53,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:43:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-01-23 09:43:53,129 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:43:53,130 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:43:53,130 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-01-23 09:43:53,188 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2025-01-23 09:43:53,192 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:43:53,228 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:43:53,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:43:53,228 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:43:53,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:43:58,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:43:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:43:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash -412972620, now seen corresponding path program 1 times [2025-01-23 09:43:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:43:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754270007] [2025-01-23 09:43:58,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:43:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:43:58,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-23 09:43:58,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-23 09:43:58,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:43:58,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:43:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:43:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:43:58,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754270007] [2025-01-23 09:43:58,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754270007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:43:58,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:43:58,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:43:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71813317] [2025-01-23 09:43:58,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:43:58,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:43:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:43:58,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:43:58,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:43:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:43:58,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:43:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:43:58,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:13,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:13,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-01-23 09:44:13,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:13,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash -112945816, now seen corresponding path program 1 times [2025-01-23 09:44:13,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:13,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122827049] [2025-01-23 09:44:13,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:44:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:13,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-23 09:44:13,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-23 09:44:13,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:13,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:44:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:44:13,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:44:13,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122827049] [2025-01-23 09:44:13,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122827049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:44:13,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:44:13,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:44:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803613240] [2025-01-23 09:44:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:44:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:44:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:44:13,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:44:13,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:44:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:13,705 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:44:13,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:44:13,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:13,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:14,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:44:14,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-01-23 09:44:14,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1553976798, now seen corresponding path program 2 times [2025-01-23 09:44:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739589101] [2025-01-23 09:44:14,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:44:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:14,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 1 equivalence classes. [2025-01-23 09:44:14,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-23 09:44:14,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:44:14,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:44:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:44:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:44:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739589101] [2025-01-23 09:44:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739589101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:44:15,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:44:15,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:44:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571007148] [2025-01-23 09:44:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:44:15,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:44:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:44:15,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:44:15,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:44:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:15,244 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:44:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:44:15,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:15,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:44:15,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:44:20,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:44:20,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-01-23 09:44:20,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:20,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash -843158211, now seen corresponding path program 1 times [2025-01-23 09:44:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709800436] [2025-01-23 09:44:20,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:44:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-23 09:44:20,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-23 09:44:20,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:20,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:44:20,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:44:20,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-23 09:44:20,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-23 09:44:20,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:20,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:44:20,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:44:20,947 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:44:20,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:44:20,947 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:44:20,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-01-23 09:44:20,949 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:44:20,949 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:44:20,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-01-23 09:44:21,007 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2025-01-23 09:44:21,011 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:44:21,042 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:44:21,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:44:21,043 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:44:21,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:44:26,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:26,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1072876566, now seen corresponding path program 1 times [2025-01-23 09:44:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950232368] [2025-01-23 09:44:26,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:44:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:26,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-23 09:44:26,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-23 09:44:26,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:26,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:44:26,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-01-23 09:44:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:44:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950232368] [2025-01-23 09:44:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950232368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:44:26,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:44:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:44:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420138954] [2025-01-23 09:44:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:44:26,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:44:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:44:26,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:44:26,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:44:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:26,982 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:44:26,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:44:26,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:42,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:42,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-01-23 09:44:42,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:42,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash -452140711, now seen corresponding path program 1 times [2025-01-23 09:44:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:42,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513974933] [2025-01-23 09:44:42,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:44:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:42,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-23 09:44:42,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-23 09:44:42,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:42,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:44:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:44:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:44:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513974933] [2025-01-23 09:44:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513974933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:44:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:44:43,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:44:43,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137732540] [2025-01-23 09:44:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:44:43,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:44:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:44:43,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:44:43,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:44:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:43,133 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:44:43,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:44:43,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:43,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:44:44,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-01-23 09:44:44,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1629601807, now seen corresponding path program 2 times [2025-01-23 09:44:44,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:44,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126621448] [2025-01-23 09:44:44,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:44:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:44,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 442 statements into 1 equivalence classes. [2025-01-23 09:44:44,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-23 09:44:44,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:44:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:44:44,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-01-23 09:44:44,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:44:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126621448] [2025-01-23 09:44:44,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126621448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:44:44,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:44:44,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:44:44,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034238141] [2025-01-23 09:44:44,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:44:44,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:44:44,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:44:44,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:44:44,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:44:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:44,872 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:44:44,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:44:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:44:44,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:44:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:44:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-01-23 09:44:51,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:51,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1677355952, now seen corresponding path program 1 times [2025-01-23 09:44:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532179840] [2025-01-23 09:44:51,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:44:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-23 09:44:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-23 09:44:51,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:51,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:44:51,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:44:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-23 09:44:51,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-23 09:44:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:44:51,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:44:51,291 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:44:51,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:44:51,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:44:51,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-01-23 09:44:51,293 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:44:51,294 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:44:51,294 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-01-23 09:44:51,352 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2025-01-23 09:44:51,355 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:44:51,397 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:44:51,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:44:51,397 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:44:51,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:44:57,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:44:57,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:44:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -601537914, now seen corresponding path program 1 times [2025-01-23 09:44:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:44:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35464637] [2025-01-23 09:44:57,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:44:57,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:44:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-23 09:44:57,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-23 09:44:57,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:44:57,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:44:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:44:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:44:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35464637] [2025-01-23 09:44:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35464637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:44:57,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:44:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:44:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984823810] [2025-01-23 09:44:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:44:57,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:44:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:44:57,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:44:57,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:44:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:44:57,972 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:44:57,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:44:57,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-01-23 09:45:15,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 202355715, now seen corresponding path program 1 times [2025-01-23 09:45:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692197076] [2025-01-23 09:45:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:45:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:15,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-23 09:45:15,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-23 09:45:15,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:15,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:45:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:45:15,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:45:15,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692197076] [2025-01-23 09:45:15,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692197076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:45:15,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:45:15,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:45:15,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119474515] [2025-01-23 09:45:15,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:45:15,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:45:15,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:45:15,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:45:15,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:45:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:15,695 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:45:15,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:45:15,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:15,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:45:16,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-01-23 09:45:16,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1589759401, now seen corresponding path program 2 times [2025-01-23 09:45:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87869908] [2025-01-23 09:45:16,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:45:16,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:16,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 462 statements into 1 equivalence classes. [2025-01-23 09:45:16,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-23 09:45:16,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:45:16,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:45:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:45:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:45:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87869908] [2025-01-23 09:45:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87869908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:45:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:45:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:45:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330219429] [2025-01-23 09:45:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:45:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:45:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:45:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:45:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:45:17,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:17,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:45:17,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:45:17,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:17,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:45:17,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:45:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:45:24,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-01-23 09:45:24,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:24,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash 613708269, now seen corresponding path program 1 times [2025-01-23 09:45:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210179006] [2025-01-23 09:45:24,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:45:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:24,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-23 09:45:24,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-23 09:45:24,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:24,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:45:24,250 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:45:24,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-23 09:45:24,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-23 09:45:24,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:24,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:45:24,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:45:24,341 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:45:24,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:45:24,341 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:45:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-01-23 09:45:24,343 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:45:24,343 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:45:24,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-01-23 09:45:24,405 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2025-01-23 09:45:24,409 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:45:24,453 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:45:24,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:45:24,454 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:45:24,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:45:31,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1489087963, now seen corresponding path program 1 times [2025-01-23 09:45:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312303930] [2025-01-23 09:45:31,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:45:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:31,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-23 09:45:31,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-23 09:45:31,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:31,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:45:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:45:31,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:45:31,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312303930] [2025-01-23 09:45:31,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312303930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:45:31,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:45:31,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:45:31,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743765917] [2025-01-23 09:45:31,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:45:31,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:45:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:45:31,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:45:31,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:45:31,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:31,328 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:45:31,328 INFO L472 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-01-23 09:45:31,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:49,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-01-23 09:45:49,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:49,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash -241427111, now seen corresponding path program 1 times [2025-01-23 09:45:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382893] [2025-01-23 09:45:49,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:45:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:50,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-23 09:45:50,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-23 09:45:50,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:50,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:45:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:45:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:45:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382893] [2025-01-23 09:45:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:45:50,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:45:50,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:45:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347767770] [2025-01-23 09:45:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:45:50,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:45:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:45:50,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:45:50,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:45:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:50,214 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:45:50,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:45:50,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:50,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:45:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-01-23 09:45:51,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1567977011, now seen corresponding path program 2 times [2025-01-23 09:45:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3062853] [2025-01-23 09:45:51,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:45:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:51,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 482 statements into 1 equivalence classes. [2025-01-23 09:45:51,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-23 09:45:51,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:45:51,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:45:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:45:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:45:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3062853] [2025-01-23 09:45:52,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3062853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:45:52,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:45:52,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:45:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558634573] [2025-01-23 09:45:52,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:45:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:45:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:45:52,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:45:52,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:45:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:52,043 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:45:52,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:45:52,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:52,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:45:52,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:45:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:45:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:45:59,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-01-23 09:45:59,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:45:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:45:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 121113252, now seen corresponding path program 1 times [2025-01-23 09:45:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:45:59,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911502212] [2025-01-23 09:45:59,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:45:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:45:59,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-23 09:45:59,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-23 09:45:59,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:59,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:45:59,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:45:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-23 09:45:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-23 09:45:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:45:59,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:45:59,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:45:59,517 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:45:59,517 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:45:59,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:45:59,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-01-23 09:45:59,520 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:45:59,520 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:45:59,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-01-23 09:45:59,584 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2025-01-23 09:45:59,588 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:45:59,633 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:45:59,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:45:59,634 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:45:59,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:46:07,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:46:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:46:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1963252002, now seen corresponding path program 1 times [2025-01-23 09:46:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:46:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762018248] [2025-01-23 09:46:07,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:46:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:46:07,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-23 09:46:07,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-23 09:46:07,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:46:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:46:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:46:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:46:07,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762018248] [2025-01-23 09:46:07,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762018248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:46:07,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:46:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:46:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513613945] [2025-01-23 09:46:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:46:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:46:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:46:07,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:46:07,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:46:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:07,256 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:46:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:46:07,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:27,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-01-23 09:46:27,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:46:27,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:46:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1968460698, now seen corresponding path program 1 times [2025-01-23 09:46:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:46:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158751895] [2025-01-23 09:46:27,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:46:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:46:27,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-23 09:46:27,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-23 09:46:27,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:46:27,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:46:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:46:27,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:46:27,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158751895] [2025-01-23 09:46:27,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158751895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:46:27,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:46:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:46:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184851390] [2025-01-23 09:46:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:46:27,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:46:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:46:27,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:46:27,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:46:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:27,739 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:46:27,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:46:27,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:27,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:46:29,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-01-23 09:46:29,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:46:29,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:46:29,038 INFO L85 PathProgramCache]: Analyzing trace with hash -679387078, now seen corresponding path program 2 times [2025-01-23 09:46:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:46:29,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757513020] [2025-01-23 09:46:29,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:46:29,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:46:29,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 502 statements into 1 equivalence classes. [2025-01-23 09:46:29,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-23 09:46:29,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:46:29,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:46:29,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-01-23 09:46:29,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:46:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757513020] [2025-01-23 09:46:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757513020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:46:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:46:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:46:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994759293] [2025-01-23 09:46:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:46:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:46:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:46:29,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:46:29,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:46:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:29,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:46:29,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:46:29,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:29,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:46:29,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:46:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:46:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-01-23 09:46:37,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:46:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:46:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 715196076, now seen corresponding path program 1 times [2025-01-23 09:46:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:46:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311834471] [2025-01-23 09:46:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:46:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:46:37,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-23 09:46:37,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-23 09:46:37,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:46:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:46:37,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:46:37,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-23 09:46:37,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-23 09:46:37,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:46:37,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:46:37,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:46:37,950 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:46:37,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:46:37,951 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:46:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-01-23 09:46:37,953 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:46:37,954 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:46:37,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-01-23 09:46:38,020 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2025-01-23 09:46:38,024 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:46:38,071 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:46:38,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:46:38,071 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:46:38,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:46:46,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:46:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:46:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 254352660, now seen corresponding path program 1 times [2025-01-23 09:46:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:46:46,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022040176] [2025-01-23 09:46:46,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:46:46,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:46:46,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-23 09:46:46,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-23 09:46:46,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:46:46,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:46:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:46:46,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:46:46,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022040176] [2025-01-23 09:46:46,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022040176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:46:46,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:46:46,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:46:46,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55166488] [2025-01-23 09:46:46,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:46:46,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:46:46,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:46:46,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:46:46,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:46:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:46:46,098 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:46:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:46:46,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:07,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-01-23 09:47:07,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:47:07,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:47:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash 278559698, now seen corresponding path program 1 times [2025-01-23 09:47:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:47:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675416928] [2025-01-23 09:47:07,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:47:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:47:07,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-23 09:47:07,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-23 09:47:07,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:47:07,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:47:07,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-01-23 09:47:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:47:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675416928] [2025-01-23 09:47:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675416928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:47:07,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:47:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:47:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811482908] [2025-01-23 09:47:07,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:47:07,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:47:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:47:07,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:47:07,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:47:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:07,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:47:07,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:47:07,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:07,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:47:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-01-23 09:47:09,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:47:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:47:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1290069646, now seen corresponding path program 2 times [2025-01-23 09:47:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:47:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782069617] [2025-01-23 09:47:09,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:47:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:47:09,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 522 statements into 1 equivalence classes. [2025-01-23 09:47:09,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-23 09:47:09,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:47:09,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:47:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:47:09,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:47:09,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782069617] [2025-01-23 09:47:09,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782069617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:47:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:47:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:47:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869491533] [2025-01-23 09:47:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:47:09,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:47:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:47:09,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:47:09,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:47:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:09,633 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:47:09,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:47:09,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:09,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:47:09,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:47:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:47:18,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-01-23 09:47:18,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:47:18,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:47:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -472487140, now seen corresponding path program 1 times [2025-01-23 09:47:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:47:18,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765454345] [2025-01-23 09:47:18,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:47:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:47:18,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-23 09:47:18,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-23 09:47:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:47:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:47:18,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:47:18,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-23 09:47:18,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-23 09:47:18,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:47:18,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:47:18,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:47:18,653 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:47:18,653 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:47:18,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:47:18,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-01-23 09:47:18,656 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:47:18,656 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:47:18,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-01-23 09:47:18,728 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2025-01-23 09:47:18,732 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:47:18,784 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:47:18,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:47:18,785 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:47:18,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:47:27,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:47:27,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:47:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1078759992, now seen corresponding path program 1 times [2025-01-23 09:47:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:47:27,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584805726] [2025-01-23 09:47:27,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:47:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:47:27,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-23 09:47:27,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-23 09:47:27,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:47:27,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:47:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:47:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:47:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584805726] [2025-01-23 09:47:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584805726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:47:27,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:47:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:47:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362851402] [2025-01-23 09:47:27,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:47:27,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:47:27,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:47:27,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:47:27,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:47:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:27,518 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:47:27,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:47:27,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:50,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-01-23 09:47:50,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:47:50,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:47:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1384170417, now seen corresponding path program 1 times [2025-01-23 09:47:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:47:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405485102] [2025-01-23 09:47:50,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:47:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:47:50,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-01-23 09:47:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-23 09:47:50,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:47:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:47:51,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-01-23 09:47:51,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:47:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405485102] [2025-01-23 09:47:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405485102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:47:51,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:47:51,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:47:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061154732] [2025-01-23 09:47:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:47:51,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:47:51,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:47:51,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:47:51,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:47:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:51,006 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:47:51,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:47:51,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:51,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:47:52,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-01-23 09:47:52,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:47:52,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:47:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -630410655, now seen corresponding path program 2 times [2025-01-23 09:47:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:47:52,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147965997] [2025-01-23 09:47:52,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:47:52,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:47:52,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 542 statements into 1 equivalence classes. [2025-01-23 09:47:52,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-23 09:47:52,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:47:52,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:47:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:47:52,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:47:52,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147965997] [2025-01-23 09:47:52,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147965997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:47:52,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:47:52,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:47:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471071192] [2025-01-23 09:47:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:47:52,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:47:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:47:52,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:47:52,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:47:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:52,925 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:47:52,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:47:52,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:47:52,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:47:52,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:48:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:48:02,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-01-23 09:48:02,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:48:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:48:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1439089734, now seen corresponding path program 1 times [2025-01-23 09:48:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:48:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970425481] [2025-01-23 09:48:02,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:48:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:48:02,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-23 09:48:02,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-23 09:48:02,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:02,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:48:02,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:48:02,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-23 09:48:02,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-23 09:48:02,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:02,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:48:02,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:48:02,418 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:48:02,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:48:02,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:48:02,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-01-23 09:48:02,420 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:48:02,420 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:48:02,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-01-23 09:48:02,476 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2025-01-23 09:48:02,480 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:48:02,521 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:48:02,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:48:02,521 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:48:02,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:48:11,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:48:11,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:48:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1802679709, now seen corresponding path program 1 times [2025-01-23 09:48:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:48:11,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455555173] [2025-01-23 09:48:11,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:48:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:48:11,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-01-23 09:48:11,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-01-23 09:48:11,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:11,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:48:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:48:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:48:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455555173] [2025-01-23 09:48:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455555173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:48:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:48:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:48:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201098709] [2025-01-23 09:48:11,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:48:11,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:48:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:48:11,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:48:11,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:48:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:11,867 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:48:11,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:48:11,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:36,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-01-23 09:48:36,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:48:36,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:48:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1581634419, now seen corresponding path program 1 times [2025-01-23 09:48:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:48:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193129231] [2025-01-23 09:48:36,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:48:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:48:36,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-23 09:48:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-23 09:48:36,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:36,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:48:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:48:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:48:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193129231] [2025-01-23 09:48:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193129231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:48:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:48:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:48:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819120256] [2025-01-23 09:48:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:48:37,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:48:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:48:37,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:48:37,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:48:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:37,147 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:48:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:48:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:48:38,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-01-23 09:48:38,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:48:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:48:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1237422793, now seen corresponding path program 2 times [2025-01-23 09:48:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:48:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788506353] [2025-01-23 09:48:38,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:48:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:48:38,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 562 statements into 1 equivalence classes. [2025-01-23 09:48:38,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-23 09:48:38,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:48:38,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:48:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:48:38,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:48:38,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788506353] [2025-01-23 09:48:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788506353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:48:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:48:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:48:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665999127] [2025-01-23 09:48:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:48:38,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:48:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:48:38,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:48:38,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:48:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:38,951 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:48:38,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:48:38,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:38,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:48:38,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:48:49,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:48:49,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-01-23 09:48:49,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:48:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:48:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -123796827, now seen corresponding path program 1 times [2025-01-23 09:48:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:48:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316352248] [2025-01-23 09:48:49,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:48:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:48:49,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-23 09:48:49,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-23 09:48:49,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:49,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:48:49,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:48:49,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-23 09:48:49,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-23 09:48:49,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:49,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:48:49,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:48:49,354 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:48:49,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:48:49,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:48:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-01-23 09:48:49,356 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:48:49,357 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:48:49,357 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-01-23 09:48:49,421 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2025-01-23 09:48:49,425 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:48:49,480 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:48:49,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:48:49,481 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:48:49,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:48:59,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:48:59,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:48:59,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1081601298, now seen corresponding path program 1 times [2025-01-23 09:48:59,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:48:59,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925264827] [2025-01-23 09:48:59,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:48:59,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:48:59,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-23 09:48:59,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-23 09:48:59,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:48:59,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:48:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:48:59,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:48:59,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925264827] [2025-01-23 09:48:59,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925264827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:48:59,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:48:59,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:48:59,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612797058] [2025-01-23 09:48:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:48:59,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:48:59,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:48:59,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:48:59,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:48:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:48:59,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:48:59,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:48:59,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:26,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:26,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-01-23 09:49:26,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:49:26,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:49:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1949629109, now seen corresponding path program 1 times [2025-01-23 09:49:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:49:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982879248] [2025-01-23 09:49:26,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:49:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:49:26,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-01-23 09:49:26,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-01-23 09:49:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:49:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:49:26,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-01-23 09:49:26,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:49:26,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982879248] [2025-01-23 09:49:26,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982879248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:49:26,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:49:26,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:49:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309033563] [2025-01-23 09:49:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:49:26,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:49:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:49:26,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:49:26,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:49:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:26,470 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:49:26,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:49:26,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:26,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:49:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-01-23 09:49:28,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:49:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:49:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2055768867, now seen corresponding path program 2 times [2025-01-23 09:49:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:49:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276296331] [2025-01-23 09:49:28,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:49:28,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:49:28,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 582 statements into 1 equivalence classes. [2025-01-23 09:49:28,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-01-23 09:49:28,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:49:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:49:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:49:28,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:49:28,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276296331] [2025-01-23 09:49:28,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276296331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:49:28,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:49:28,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:49:28,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246095936] [2025-01-23 09:49:28,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:49:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 09:49:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:49:28,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 09:49:28,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-23 09:49:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:28,632 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:49:28,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:49:28,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:28,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:49:28,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:49:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:49:39,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-01-23 09:49:39,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:49:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:49:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1914564370, now seen corresponding path program 1 times [2025-01-23 09:49:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:49:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973960592] [2025-01-23 09:49:39,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:49:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:49:39,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-23 09:49:39,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-23 09:49:39,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:49:39,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:49:39,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:49:39,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-23 09:49:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-23 09:49:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:49:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:49:39,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:49:39,892 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:49:39,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:49:39,892 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:49:39,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-01-23 09:49:39,896 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:49:39,896 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:49:39,896 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-01-23 09:49:39,971 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2025-01-23 09:49:39,976 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:49:40,032 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:49:40,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:49:40,033 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:49:40,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:49:50,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:49:50,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:49:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1670217966, now seen corresponding path program 1 times [2025-01-23 09:49:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:49:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039012735] [2025-01-23 09:49:50,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:49:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:49:50,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-23 09:49:50,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-23 09:49:50,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:49:50,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:49:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:49:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:49:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039012735] [2025-01-23 09:49:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039012735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:49:50,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:49:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:49:50,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416059239] [2025-01-23 09:49:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:49:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:49:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:49:50,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:49:50,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:49:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:49:50,844 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:49:50,844 INFO L472 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-01-23 09:49:50,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-01-23 09:50:18,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:50:18,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:50:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 422143218, now seen corresponding path program 1 times [2025-01-23 09:50:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:50:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275619406] [2025-01-23 09:50:18,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:50:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:50:18,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-01-23 09:50:18,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-01-23 09:50:18,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:50:18,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:50:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:50:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:50:18,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275619406] [2025-01-23 09:50:18,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275619406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:50:18,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:50:18,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:50:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549946804] [2025-01-23 09:50:18,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:50:18,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:50:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:50:18,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:50:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:50:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:18,727 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:50:18,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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-01-23 09:50:18,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:18,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:50:20,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-01-23 09:50:20,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:50:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:50:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -190071896, now seen corresponding path program 2 times [2025-01-23 09:50:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:50:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441005876] [2025-01-23 09:50:20,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:50:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:50:20,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 602 statements into 1 equivalence classes. [2025-01-23 09:50:20,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-01-23 09:50:20,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:50:20,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:50:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:50:20,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:50:20,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441005876] [2025-01-23 09:50:20,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441005876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:50:20,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:50:20,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:50:20,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085388697] [2025-01-23 09:50:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:50:20,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:50:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:50:20,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:50:20,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:50:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:20,584 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:50:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-01-23 09:50:20,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:20,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:50:20,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:50:32,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:50:32,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-01-23 09:50:32,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:50:32,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:50:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash 475183324, now seen corresponding path program 1 times [2025-01-23 09:50:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:50:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61450674] [2025-01-23 09:50:32,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:50:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:50:32,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-23 09:50:32,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-23 09:50:32,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:50:32,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:50:32,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:50:32,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-23 09:50:32,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-23 09:50:32,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:50:32,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:50:32,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:50:32,274 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:50:32,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:50:32,274 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:50:32,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-01-23 09:50:32,276 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:50:32,276 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:50:32,276 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2025-01-23 09:50:32,352 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2025-01-23 09:50:32,357 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:50:32,409 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:50:32,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:50:32,411 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:50:32,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:50:43,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:50:43,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:50:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1869638994, now seen corresponding path program 1 times [2025-01-23 09:50:43,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:50:43,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810670220] [2025-01-23 09:50:43,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:50:43,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:50:43,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-23 09:50:43,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-23 09:50:43,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:50:43,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:50:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:50:43,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:50:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810670220] [2025-01-23 09:50:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810670220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:50:43,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:50:43,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:50:43,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028981242] [2025-01-23 09:50:43,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:50:43,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:50:43,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:50:43,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:50:43,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:50:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:50:43,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:50:43,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:50:43,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-01-23 09:51:14,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:51:14,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:51:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -154258369, now seen corresponding path program 1 times [2025-01-23 09:51:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:51:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818261296] [2025-01-23 09:51:14,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:51:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:51:14,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-23 09:51:14,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-23 09:51:14,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:51:14,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:51:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:51:15,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:51:15,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818261296] [2025-01-23 09:51:15,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818261296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:51:15,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:51:15,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:51:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218182098] [2025-01-23 09:51:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:51:15,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:51:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:51:15,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:51:15,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:51:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:15,363 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:51:15,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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-01-23 09:51:15,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:15,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:51:16,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-01-23 09:51:16,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:51:16,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:51:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1766934717, now seen corresponding path program 2 times [2025-01-23 09:51:16,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:51:16,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336832209] [2025-01-23 09:51:16,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:51:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:51:16,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 622 statements into 1 equivalence classes. [2025-01-23 09:51:16,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-23 09:51:16,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:51:16,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:51:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:51:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:51:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336832209] [2025-01-23 09:51:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336832209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:51:17,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:51:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:51:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884537467] [2025-01-23 09:51:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:51:17,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:51:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:51:17,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:51:17,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:51:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:17,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:51:17,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 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-01-23 09:51:17,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:17,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:51:17,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:51:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:51:30,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-01-23 09:51:30,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:51:30,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:51:30,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1575814417, now seen corresponding path program 1 times [2025-01-23 09:51:30,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:51:30,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612798787] [2025-01-23 09:51:30,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:51:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:51:30,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-23 09:51:30,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-23 09:51:30,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:51:30,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:51:30,736 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:51:30,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-23 09:51:30,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-23 09:51:30,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:51:30,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:51:30,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:51:30,887 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:51:30,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:51:30,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:51:30,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-01-23 09:51:30,891 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:51:30,892 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:51:30,892 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2025-01-23 09:51:30,970 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2025-01-23 09:51:30,975 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:51:31,032 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:51:31,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:51:31,033 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:51:31,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:51:42,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:51:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:51:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 653499167, now seen corresponding path program 1 times [2025-01-23 09:51:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:51:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828772616] [2025-01-23 09:51:42,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:51:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:51:42,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-23 09:51:42,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-23 09:51:42,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:51:42,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:51: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-01-23 09:51:43,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:51:43,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828772616] [2025-01-23 09:51:43,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828772616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:51:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:51:43,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:51:43,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388897407] [2025-01-23 09:51:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:51:43,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:51:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:51:43,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:51:43,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:51:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:51:43,006 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:51:43,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 09:51:43,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-01-23 09:52:16,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:52:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:52:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2138587194, now seen corresponding path program 1 times [2025-01-23 09:52:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:52:16,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687500648] [2025-01-23 09:52:16,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:52:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:52:16,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-01-23 09:52:16,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-23 09:52:16,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:52:16,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:52:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:52:16,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:52:16,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687500648] [2025-01-23 09:52:16,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687500648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:52:16,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:52:16,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 09:52:16,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987664810] [2025-01-23 09:52:16,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:52:16,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 09:52:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:52:16,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 09:52:16,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 09:52:16,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:16,772 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:52:16,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 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-01-23 09:52:16,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:16,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:18,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:52:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-01-23 09:52:18,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:52:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:52:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -262057816, now seen corresponding path program 2 times [2025-01-23 09:52:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:52:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820697331] [2025-01-23 09:52:18,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 09:52:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:52:18,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 642 statements into 1 equivalence classes. [2025-01-23 09:52:18,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-23 09:52:18,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 09:52:18,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:52:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:52:19,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:52:19,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820697331] [2025-01-23 09:52:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820697331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:52:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:52:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 09:52:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711522027] [2025-01-23 09:52:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:52:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 09:52:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:52:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 09:52:19,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 09:52:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:19,013 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:52:19,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 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-01-23 09:52:19,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:19,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:52:19,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 09:52:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 09:52:32,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-01-23 09:52:32,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:52:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:52:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1172877265, now seen corresponding path program 1 times [2025-01-23 09:52:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:52:32,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430471297] [2025-01-23 09:52:32,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:52:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:52:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-23 09:52:32,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-23 09:52:32,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:52:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:52:32,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 09:52:32,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-23 09:52:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-23 09:52:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:52:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 09:52:32,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 09:52:32,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 09:52:32,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 09:52:32,392 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-23 09:52:32,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-01-23 09:52:32,394 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-23 09:52:32,394 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 09:52:32,395 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2025-01-23 09:52:32,471 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2025-01-23 09:52:32,475 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:52:32,532 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 09:52:32,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 09:52:32,533 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d208381, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 09:52:32,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 09:52:46,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 09:52:46,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 09:52:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1855480784, now seen corresponding path program 1 times [2025-01-23 09:52:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 09:52:46,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453513302] [2025-01-23 09:52:46,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 09:52:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 09:52:46,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-23 09:52:46,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-23 09:52:46,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 09:52:46,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 09:52:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 09:52:46,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 09:52:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453513302] [2025-01-23 09:52:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453513302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 09:52:46,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 09:52:46,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 09:52:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649399796] [2025-01-23 09:52:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 09:52:46,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-23 09:52:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 09:52:46,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-23 09:52:46,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-23 09:52:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 09:52:46,100 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 09:52:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 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-01-23 09:52:46,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15