./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i --full-output --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1f73d82f 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 ../sv-benchmarks/c/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.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1f73d82-m [2024-11-21 14:46:20,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 14:46:21,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-21 14:46:21,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 14:46:21,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 14:46:21,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 14:46:21,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 14:46:21,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 14:46:21,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 14:46:21,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 14:46:21,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 14:46:21,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 14:46:21,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 14:46:21,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 14:46:21,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 14:46:21,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * Commutativity condition synthesis=SUFFICIENT [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 14:46:21,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 14:46:21,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 14:46:21,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 14:46:21,053 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 14:46:21,053 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 14:46:21,054 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: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-21 14:46:21,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 14:46:21,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 14:46:21,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 14:46:21,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 14:46:21,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 14:46:21,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-21 14:46:22,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/76ceac59c/1cc939e4bb3a469c86acee2afb9cdce6/FLAG3d89189a8 [2024-11-21 14:46:23,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 14:46:23,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i [2024-11-21 14:46:23,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/76ceac59c/1cc939e4bb3a469c86acee2afb9cdce6/FLAG3d89189a8 [2024-11-21 14:46:23,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/76ceac59c/1cc939e4bb3a469c86acee2afb9cdce6 [2024-11-21 14:46:23,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 14:46:23,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 14:46:23,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 14:46:23,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 14:46:23,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 14:46:23,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338e273a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23, skipping insertion in model container [2024-11-21 14:46:23,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 14:46:23,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2024-11-21 14:46:23,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 14:46:23,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 14:46:23,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_08-cond_racefree.i[41322,41335] [2024-11-21 14:46:23,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 14:46:23,799 INFO L204 MainTranslator]: Completed translation [2024-11-21 14:46:23,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23 WrapperNode [2024-11-21 14:46:23,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 14:46:23,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 14:46:23,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 14:46:23,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 14:46:23,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,857 INFO L138 Inliner]: procedures = 271, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 139 [2024-11-21 14:46:23,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 14:46:23,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 14:46:23,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 14:46:23,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 14:46:23,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 14:46:23,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 14:46:23,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 14:46:23,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 14:46:23,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (1/1) ... [2024-11-21 14:46:23,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 14:46:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 14:46:23,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 14:46:23,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-21 14:46:23,973 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-21 14:46:23,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 14:46:23,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 14:46:23,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 14:46:23,975 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 14:46:24,099 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 14:46:24,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 14:46:24,382 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 14:46:24,383 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 14:46:24,713 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 14:46:24,715 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-21 14:46:24,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:46:24 BoogieIcfgContainer [2024-11-21 14:46:24,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 14:46:24,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 14:46:24,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 14:46:24,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 14:46:24,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:46:23" (1/3) ... [2024-11-21 14:46:24,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15553693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:46:24, skipping insertion in model container [2024-11-21 14:46:24,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:46:23" (2/3) ... [2024-11-21 14:46:24,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15553693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:46:24, skipping insertion in model container [2024-11-21 14:46:24,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:46:24" (3/3) ... [2024-11-21 14:46:24,730 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_08-cond_racefree.i [2024-11-21 14:46:24,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 14:46:24,747 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. [2024-11-21 14:46:24,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 14:46:24,799 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-21 14:46:24,857 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:24,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 14:46:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 14:46:24,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 14:46:24,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 14:46:24,956 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:24,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:24,982 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:24,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:25,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:25,157 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:25,157 INFO L139 ounterexampleChecker]: Examining path program with hash -49702520, occurence #1 [2024-11-21 14:46:25,157 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:25,158 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:25,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash -472337074, now seen corresponding path program 1 times [2024-11-21 14:46:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282973948] [2024-11-21 14:46:25,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:25,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282973948] [2024-11-21 14:46:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282973948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:25,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:25,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612248358] [2024-11-21 14:46:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:25,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:25,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:25,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:25,486 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:25,488 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) [2024-11-21 14:46:25,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:25,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 14:46:25,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:25,583 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:25,583 INFO L139 ounterexampleChecker]: Examining path program with hash -332058082, occurence #1 [2024-11-21 14:46:25,583 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:25,583 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -366971700, now seen corresponding path program 1 times [2024-11-21 14:46:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660903763] [2024-11-21 14:46:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:25,671 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:25,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:25,732 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:25,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:25,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:25,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 14:46:25,743 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 14:46:25,745 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:25,745 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-21 14:46:25,777 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-21 14:46:25,782 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:25,789 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:25,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:25,791 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:25,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:26,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:26,093 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:26,094 INFO L139 ounterexampleChecker]: Examining path program with hash -857269520, occurence #1 [2024-11-21 14:46:26,094 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:26,094 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1971145828, now seen corresponding path program 1 times [2024-11-21 14:46:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479675495] [2024-11-21 14:46:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479675495] [2024-11-21 14:46:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479675495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:26,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088423091] [2024-11-21 14:46:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:26,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:26,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:26,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,178 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:26,179 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) [2024-11-21 14:46:26,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 14:46:26,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:26,578 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:26,578 INFO L139 ounterexampleChecker]: Examining path program with hash -702548917, occurence #1 [2024-11-21 14:46:26,578 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:26,578 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 682820780, now seen corresponding path program 1 times [2024-11-21 14:46:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107094331] [2024-11-21 14:46:26,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:26,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:26,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107094331] [2024-11-21 14:46:26,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107094331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:26,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:26,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537492007] [2024-11-21 14:46:26,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:26,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:26,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,830 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:26,830 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) [2024-11-21 14:46:26,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:26,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 14:46:26,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:26,985 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:26,985 INFO L139 ounterexampleChecker]: Examining path program with hash 1856763371, occurence #1 [2024-11-21 14:46:26,985 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:26,985 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:26,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1372423479, now seen corresponding path program 1 times [2024-11-21 14:46:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:26,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544880035] [2024-11-21 14:46:26,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:26,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544880035] [2024-11-21 14:46:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544880035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059487793] [2024-11-21 14:46:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:27,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:27,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:27,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:27,330 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:27,331 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) [2024-11-21 14:46:27,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:27,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:27,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:27,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 14:46:27,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:27,427 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:27,427 INFO L139 ounterexampleChecker]: Examining path program with hash 2087367909, occurence #1 [2024-11-21 14:46:27,427 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:27,427 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:27,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash -713656586, now seen corresponding path program 1 times [2024-11-21 14:46:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889507622] [2024-11-21 14:46:27,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:27,461 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:27,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:27,489 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:27,490 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:27,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:27,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 14:46:27,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:27,493 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:27,493 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-21 14:46:27,520 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-21 14:46:27,522 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:27,535 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:27,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:27,539 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:27,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:27,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:27,926 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:27,927 INFO L139 ounterexampleChecker]: Examining path program with hash 96388523, occurence #1 [2024-11-21 14:46:27,928 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:27,928 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:27,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 957465559, now seen corresponding path program 1 times [2024-11-21 14:46:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384377151] [2024-11-21 14:46:27,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384377151] [2024-11-21 14:46:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384377151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:27,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306754343] [2024-11-21 14:46:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:27,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:27,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:27,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:27,999 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:27,999 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) [2024-11-21 14:46:28,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 14:46:28,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:28,885 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:28,885 INFO L139 ounterexampleChecker]: Examining path program with hash 1822166635, occurence #1 [2024-11-21 14:46:28,886 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:28,886 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1046196247, now seen corresponding path program 1 times [2024-11-21 14:46:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941159588] [2024-11-21 14:46:28,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941159588] [2024-11-21 14:46:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941159588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:29,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335943473] [2024-11-21 14:46:29,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:29,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:29,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:29,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,066 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:29,066 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) [2024-11-21 14:46:29,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:29,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 14:46:29,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:29,250 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:29,251 INFO L139 ounterexampleChecker]: Examining path program with hash 367287855, occurence #1 [2024-11-21 14:46:29,251 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:29,251 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:29,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:29,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1553748314, now seen corresponding path program 1 times [2024-11-21 14:46:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:29,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989635360] [2024-11-21 14:46:29,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989635360] [2024-11-21 14:46:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989635360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755065350] [2024-11-21 14:46:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:29,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:29,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,537 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:29,538 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) [2024-11-21 14:46:29,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:29,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:29,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 14:46:29,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:29,748 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:29,748 INFO L139 ounterexampleChecker]: Examining path program with hash 1942146971, occurence #1 [2024-11-21 14:46:29,748 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:29,748 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:29,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -107457601, now seen corresponding path program 1 times [2024-11-21 14:46:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:29,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066763202] [2024-11-21 14:46:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:29,789 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:29,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:29,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:29,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:29,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 14:46:29,831 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:29,831 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:29,831 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-21 14:46:29,854 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-21 14:46:29,857 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:29,867 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:29,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:29,868 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:29,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:30,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:30,367 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:30,367 INFO L139 ounterexampleChecker]: Examining path program with hash 801533062, occurence #1 [2024-11-21 14:46:30,368 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:30,368 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1827686070, now seen corresponding path program 1 times [2024-11-21 14:46:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919506487] [2024-11-21 14:46:30,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:30,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919506487] [2024-11-21 14:46:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919506487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65606327] [2024-11-21 14:46:30,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:30,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:30,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:30,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:30,414 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:30,415 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) [2024-11-21 14:46:30,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:31,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:31,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 14:46:31,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:31,686 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:31,687 INFO L139 ounterexampleChecker]: Examining path program with hash 1556933008, occurence #1 [2024-11-21 14:46:31,687 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:31,687 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:31,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1642732025, now seen corresponding path program 1 times [2024-11-21 14:46:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559562088] [2024-11-21 14:46:31,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:31,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:31,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:31,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559562088] [2024-11-21 14:46:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559562088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495445836] [2024-11-21 14:46:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:31,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:31,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:31,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:31,815 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) [2024-11-21 14:46:31,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:31,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:32,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 14:46:32,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:32,049 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:32,050 INFO L139 ounterexampleChecker]: Examining path program with hash -1542846241, occurence #1 [2024-11-21 14:46:32,050 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:32,051 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:32,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash 974742749, now seen corresponding path program 1 times [2024-11-21 14:46:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574425340] [2024-11-21 14:46:32,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:32,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:32,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:32,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:32,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574425340] [2024-11-21 14:46:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574425340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:32,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89524869] [2024-11-21 14:46:32,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:32,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:46:32,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:32,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:46:32,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:46:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:32,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:32,329 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) [2024-11-21 14:46:32,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:32,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:32,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:32,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:32,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 14:46:32,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:32,555 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:32,555 INFO L139 ounterexampleChecker]: Examining path program with hash -1882133716, occurence #1 [2024-11-21 14:46:32,555 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:32,555 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:32,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:32,556 INFO L85 PathProgramCache]: Analyzing trace with hash -721545480, now seen corresponding path program 1 times [2024-11-21 14:46:32,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:32,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790915928] [2024-11-21 14:46:32,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:32,597 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:32,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:32,633 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:32,633 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:32,633 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:32,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 14:46:32,636 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:32,637 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:32,637 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-21 14:46:32,673 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-21 14:46:32,677 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:32,690 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:32,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:32,691 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:32,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:33,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:33,295 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:33,295 INFO L139 ounterexampleChecker]: Examining path program with hash 348884264, occurence #1 [2024-11-21 14:46:33,295 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:33,295 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:33,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1111797400, now seen corresponding path program 1 times [2024-11-21 14:46:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:33,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715911002] [2024-11-21 14:46:33,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715911002] [2024-11-21 14:46:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715911002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:33,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220302343] [2024-11-21 14:46:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:33,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:33,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:33,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:33,356 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:33,356 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) [2024-11-21 14:46:33,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 14:46:35,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:35,014 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:35,014 INFO L139 ounterexampleChecker]: Examining path program with hash 3495569, occurence #1 [2024-11-21 14:46:35,014 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:35,014 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:35,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1014852312, now seen corresponding path program 1 times [2024-11-21 14:46:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021515190] [2024-11-21 14:46:35,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:35,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:35,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021515190] [2024-11-21 14:46:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021515190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:35,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:35,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245746782] [2024-11-21 14:46:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:35,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:35,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,147 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:35,147 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) [2024-11-21 14:46:35,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:35,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 14:46:35,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:35,439 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:35,439 INFO L139 ounterexampleChecker]: Examining path program with hash -816121998, occurence #1 [2024-11-21 14:46:35,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:35,440 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:35,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash -260136753, now seen corresponding path program 1 times [2024-11-21 14:46:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:35,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291824190] [2024-11-21 14:46:35,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:35,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291824190] [2024-11-21 14:46:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291824190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:35,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:35,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:35,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714172581] [2024-11-21 14:46:35,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:35,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:35,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:35,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:35,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:35,717 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) [2024-11-21 14:46:35,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:35,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:35,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:36,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:36,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 14:46:36,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:36,056 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:36,056 INFO L139 ounterexampleChecker]: Examining path program with hash 2064104520, occurence #1 [2024-11-21 14:46:36,056 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:36,056 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:36,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1626351726, now seen corresponding path program 1 times [2024-11-21 14:46:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014845389] [2024-11-21 14:46:36,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:36,093 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:36,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:36,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:36,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:36,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 14:46:36,140 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:36,140 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:36,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-21 14:46:36,162 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-21 14:46:36,165 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:36,179 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:36,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:36,179 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:36,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:36,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:36,859 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:36,859 INFO L139 ounterexampleChecker]: Examining path program with hash -756502683, occurence #1 [2024-11-21 14:46:36,859 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:36,859 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:36,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:36,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1565699304, now seen corresponding path program 1 times [2024-11-21 14:46:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:36,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169809195] [2024-11-21 14:46:36,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169809195] [2024-11-21 14:46:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169809195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:36,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:36,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:36,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427056911] [2024-11-21 14:46:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:36,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:36,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:36,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:36,893 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:36,893 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) [2024-11-21 14:46:36,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:38,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 14:46:38,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:38,859 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:38,859 INFO L139 ounterexampleChecker]: Examining path program with hash 482358581, occurence #1 [2024-11-21 14:46:38,859 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:38,859 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2108344585, now seen corresponding path program 1 times [2024-11-21 14:46:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920048856] [2024-11-21 14:46:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920048856] [2024-11-21 14:46:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920048856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91692749] [2024-11-21 14:46:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:39,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:39,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:39,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:39,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:39,001 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:39,001 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) [2024-11-21 14:46:39,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:39,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:39,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 14:46:39,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:39,400 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:39,400 INFO L139 ounterexampleChecker]: Examining path program with hash -2013274418, occurence #1 [2024-11-21 14:46:39,400 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:39,400 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:39,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -858847731, now seen corresponding path program 1 times [2024-11-21 14:46:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328235897] [2024-11-21 14:46:39,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328235897] [2024-11-21 14:46:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328235897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:39,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:39,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025586164] [2024-11-21 14:46:39,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:39,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:39,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:39,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:39,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:39,644 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) [2024-11-21 14:46:39,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:39,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:39,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:40,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 14:46:40,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:40,168 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:40,168 INFO L139 ounterexampleChecker]: Examining path program with hash -2029168332, occurence #1 [2024-11-21 14:46:40,168 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:40,168 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:40,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1973459480, now seen corresponding path program 1 times [2024-11-21 14:46:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311497167] [2024-11-21 14:46:40,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:40,209 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:40,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:40,242 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:40,242 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:40,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 14:46:40,243 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:40,244 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:40,244 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-21 14:46:40,274 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-11-21 14:46:40,277 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:40,294 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:40,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:40,295 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:40,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:41,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:41,229 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:41,229 INFO L139 ounterexampleChecker]: Examining path program with hash -1240350078, occurence #1 [2024-11-21 14:46:41,229 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:41,229 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:41,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash -613740523, now seen corresponding path program 1 times [2024-11-21 14:46:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899986931] [2024-11-21 14:46:41,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899986931] [2024-11-21 14:46:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899986931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:41,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:41,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:41,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046409237] [2024-11-21 14:46:41,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:41,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:41,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:41,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:41,267 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:41,268 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) [2024-11-21 14:46:41,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:43,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 14:46:43,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:43,992 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:43,993 INFO L139 ounterexampleChecker]: Examining path program with hash -995625073, occurence #1 [2024-11-21 14:46:43,993 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:43,993 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:43,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1037065259, now seen corresponding path program 1 times [2024-11-21 14:46:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:43,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480698440] [2024-11-21 14:46:43,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:44,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480698440] [2024-11-21 14:46:44,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480698440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:44,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:44,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721982484] [2024-11-21 14:46:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:44,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:44,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:44,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:44,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:44,188 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:44,188 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) [2024-11-21 14:46:44,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:44,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:44,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-21 14:46:44,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:44,647 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:44,647 INFO L139 ounterexampleChecker]: Examining path program with hash -1270154261, occurence #1 [2024-11-21 14:46:44,647 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:44,647 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:44,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2034258974, now seen corresponding path program 1 times [2024-11-21 14:46:44,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:44,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121616267] [2024-11-21 14:46:44,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121616267] [2024-11-21 14:46:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121616267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:44,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:44,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235587872] [2024-11-21 14:46:44,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:44,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:44,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:44,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:44,897 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) [2024-11-21 14:46:44,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:44,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:44,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 14:46:45,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:45,476 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:45,477 INFO L139 ounterexampleChecker]: Examining path program with hash 845572640, occurence #1 [2024-11-21 14:46:45,477 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:45,477 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:45,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:45,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1275114204, now seen corresponding path program 1 times [2024-11-21 14:46:45,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832928141] [2024-11-21 14:46:45,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:45,511 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:45,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:45,545 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:45,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:45,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:45,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-21 14:46:45,547 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:45,548 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:45,549 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-21 14:46:45,578 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-11-21 14:46:45,581 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:45,596 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:45,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:45,598 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:45,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:46,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:46,726 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:46,726 INFO L139 ounterexampleChecker]: Examining path program with hash 577470099, occurence #1 [2024-11-21 14:46:46,726 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:46,726 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:46,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash -314257302, now seen corresponding path program 1 times [2024-11-21 14:46:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:46,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050763024] [2024-11-21 14:46:46,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:46,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050763024] [2024-11-21 14:46:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050763024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639280448] [2024-11-21 14:46:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:46,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:46,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:46,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:46,761 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:46,761 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) [2024-11-21 14:46:46,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-21 14:46:50,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:50,181 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:50,181 INFO L139 ounterexampleChecker]: Examining path program with hash -1725542616, occurence #1 [2024-11-21 14:46:50,181 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:50,181 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:50,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1399817403, now seen corresponding path program 1 times [2024-11-21 14:46:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143208108] [2024-11-21 14:46:50,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:50,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:50,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143208108] [2024-11-21 14:46:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143208108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025778714] [2024-11-21 14:46:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:50,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:50,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:50,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:50,328 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) [2024-11-21 14:46:50,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:50,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:50,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:50,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-21 14:46:50,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:50,915 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:50,915 INFO L139 ounterexampleChecker]: Examining path program with hash -458320691, occurence #1 [2024-11-21 14:46:50,915 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:50,915 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:50,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash 612390896, now seen corresponding path program 1 times [2024-11-21 14:46:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:50,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754740017] [2024-11-21 14:46:50,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:50,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754740017] [2024-11-21 14:46:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754740017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146128950] [2024-11-21 14:46:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:51,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:51,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:51,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:51,144 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:51,144 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) [2024-11-21 14:46:51,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:51,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:51,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:51,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:51,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-21 14:46:51,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:51,985 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:51,985 INFO L139 ounterexampleChecker]: Examining path program with hash -351825542, occurence #1 [2024-11-21 14:46:51,985 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:51,985 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:51,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1313713249, now seen corresponding path program 1 times [2024-11-21 14:46:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:51,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673989764] [2024-11-21 14:46:51,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:51,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:52,032 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:52,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:52,080 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:52,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:52,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:52,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-21 14:46:52,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:52,084 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:52,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-21 14:46:52,118 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-11-21 14:46:52,120 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:52,137 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:52,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:52,137 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:52,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:46:53,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:53,323 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:53,323 INFO L139 ounterexampleChecker]: Examining path program with hash 509259758, occurence #1 [2024-11-21 14:46:53,323 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:53,323 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2045450322, now seen corresponding path program 1 times [2024-11-21 14:46:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191219105] [2024-11-21 14:46:53,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191219105] [2024-11-21 14:46:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191219105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:53,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:46:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744606015] [2024-11-21 14:46:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:53,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:46:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:53,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:46:53,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:46:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:53,375 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:53,375 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) [2024-11-21 14:46:53,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-21 14:46:56,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:56,768 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:56,768 INFO L139 ounterexampleChecker]: Examining path program with hash 1879181829, occurence #1 [2024-11-21 14:46:56,768 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:56,769 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 217374966, now seen corresponding path program 1 times [2024-11-21 14:46:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414833929] [2024-11-21 14:46:56,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:56,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414833929] [2024-11-21 14:46:56,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414833929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:56,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:46:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511089033] [2024-11-21 14:46:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:56,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:46:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:56,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:46:56,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:46:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:56,905 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:56,906 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) [2024-11-21 14:46:56,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:56,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:57,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-21 14:46:57,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:57,540 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:57,540 INFO L139 ounterexampleChecker]: Examining path program with hash 1212974971, occurence #1 [2024-11-21 14:46:57,540 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:57,540 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:57,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:57,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2107909891, now seen corresponding path program 1 times [2024-11-21 14:46:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:57,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108654319] [2024-11-21 14:46:57,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:57,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:46:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:46:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:46:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108654319] [2024-11-21 14:46:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108654319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:46:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:46:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:46:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329940712] [2024-11-21 14:46:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:46:57,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:46:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:46:57,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:46:57,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:46:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:57,780 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:46:57,781 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) [2024-11-21 14:46:57,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:57,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:57,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:46:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:46:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:46:58,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-21 14:46:58,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:46:58,698 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:46:58,699 INFO L139 ounterexampleChecker]: Examining path program with hash -687904852, occurence #1 [2024-11-21 14:46:58,699 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:46:58,699 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:46:58,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:46:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash -721909458, now seen corresponding path program 1 times [2024-11-21 14:46:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:46:58,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259842452] [2024-11-21 14:46:58,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:46:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:46:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:58,733 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:46:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:46:58,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:46:58,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:46:58,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:46:58,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:46:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-21 14:46:58,773 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:46:58,773 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:46:58,774 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-21 14:46:58,802 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-11-21 14:46:58,805 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:58,825 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:46:58,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:46:58,826 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:46:58,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:47:00,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:00,264 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:00,264 INFO L139 ounterexampleChecker]: Examining path program with hash -1904212601, occurence #1 [2024-11-21 14:47:00,265 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:00,265 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:00,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1628536182, now seen corresponding path program 1 times [2024-11-21 14:47:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578140724] [2024-11-21 14:47:00,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578140724] [2024-11-21 14:47:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578140724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:47:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911554639] [2024-11-21 14:47:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:47:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:47:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:47:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:00,293 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:00,293 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) [2024-11-21 14:47:00,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:04,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-21 14:47:04,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:04,215 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:04,215 INFO L139 ounterexampleChecker]: Examining path program with hash 1625885113, occurence #1 [2024-11-21 14:47:04,215 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:04,215 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash -573941647, now seen corresponding path program 1 times [2024-11-21 14:47:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874021956] [2024-11-21 14:47:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874021956] [2024-11-21 14:47:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874021956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:04,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:04,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477927542] [2024-11-21 14:47:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:04,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:47:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:04,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:47:04,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:47:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:04,334 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:04,334 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) [2024-11-21 14:47:04,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:04,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:05,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-21 14:47:05,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:05,004 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:05,004 INFO L139 ounterexampleChecker]: Examining path program with hash -1024695332, occurence #1 [2024-11-21 14:47:05,004 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:05,004 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:05,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:05,004 INFO L85 PathProgramCache]: Analyzing trace with hash -241020993, now seen corresponding path program 1 times [2024-11-21 14:47:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:05,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310723765] [2024-11-21 14:47:05,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:05,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310723765] [2024-11-21 14:47:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310723765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:05,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:47:05,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974432899] [2024-11-21 14:47:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:05,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:47:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:05,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:47:05,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:47:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:05,182 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:05,182 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) [2024-11-21 14:47:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:05,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:47:06,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-21 14:47:06,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:06,084 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:06,085 INFO L139 ounterexampleChecker]: Examining path program with hash -2133859517, occurence #1 [2024-11-21 14:47:06,085 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:06,085 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:06,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1993992623, now seen corresponding path program 1 times [2024-11-21 14:47:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:06,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453872949] [2024-11-21 14:47:06,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:06,116 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:47:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:06,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:47:06,148 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:47:06,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:47:06,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:47:06,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-21 14:47:06,150 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:47:06,151 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:47:06,151 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-21 14:47:06,231 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-11-21 14:47:06,233 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:06,253 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:47:06,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:47:06,254 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:06,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:47:07,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:07,882 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:07,882 INFO L139 ounterexampleChecker]: Examining path program with hash -1508186729, occurence #1 [2024-11-21 14:47:07,882 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:07,882 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:07,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash 405327939, now seen corresponding path program 1 times [2024-11-21 14:47:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284138575] [2024-11-21 14:47:07,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:07,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:07,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284138575] [2024-11-21 14:47:07,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284138575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:07,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:07,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:47:07,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168502911] [2024-11-21 14:47:07,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:07,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:47:07,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:07,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:47:07,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:47:07,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:07,922 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:07,922 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) [2024-11-21 14:47:07,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:12,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-21 14:47:12,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:12,342 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:12,342 INFO L139 ounterexampleChecker]: Examining path program with hash -857968347, occurence #1 [2024-11-21 14:47:12,342 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:12,342 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:12,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1711016407, now seen corresponding path program 1 times [2024-11-21 14:47:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879885935] [2024-11-21 14:47:12,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:12,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:12,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879885935] [2024-11-21 14:47:12,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879885935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:12,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:12,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729660087] [2024-11-21 14:47:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:12,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:47:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:12,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:47:12,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:47:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:12,456 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:12,456 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) [2024-11-21 14:47:12,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:12,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:13,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-21 14:47:13,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:13,185 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:13,186 INFO L139 ounterexampleChecker]: Examining path program with hash 133604548, occurence #1 [2024-11-21 14:47:13,186 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:13,186 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:13,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1412460515, now seen corresponding path program 1 times [2024-11-21 14:47:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:13,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459578868] [2024-11-21 14:47:13,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:13,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459578868] [2024-11-21 14:47:13,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459578868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:13,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:47:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839437339] [2024-11-21 14:47:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:13,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:47:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:13,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:47:13,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:47:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:13,429 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:13,429 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) [2024-11-21 14:47:13,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:13,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:13,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:47:14,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-21 14:47:14,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:14,725 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:14,725 INFO L139 ounterexampleChecker]: Examining path program with hash -1637437092, occurence #1 [2024-11-21 14:47:14,725 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:14,725 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:14,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 652703549, now seen corresponding path program 1 times [2024-11-21 14:47:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662743945] [2024-11-21 14:47:14,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:14,760 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:47:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:14,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:47:14,795 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:47:14,795 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:47:14,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:47:14,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-21 14:47:14,797 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:47:14,797 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:47:14,797 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-21 14:47:14,838 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-11-21 14:47:14,841 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:14,867 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:47:14,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:47:14,868 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:14,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:47:16,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:16,865 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:16,865 INFO L139 ounterexampleChecker]: Examining path program with hash 443051542, occurence #1 [2024-11-21 14:47:16,865 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:16,865 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:16,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash -899554568, now seen corresponding path program 1 times [2024-11-21 14:47:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698065962] [2024-11-21 14:47:16,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698065962] [2024-11-21 14:47:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698065962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:16,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:47:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480210089] [2024-11-21 14:47:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:16,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:47:16,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:16,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:47:16,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:47:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:16,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:16,907 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) [2024-11-21 14:47:16,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:22,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-21 14:47:22,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:22,061 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:22,061 INFO L139 ounterexampleChecker]: Examining path program with hash 1726865401, occurence #1 [2024-11-21 14:47:22,061 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:22,061 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1780699558, now seen corresponding path program 1 times [2024-11-21 14:47:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:22,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809498159] [2024-11-21 14:47:22,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809498159] [2024-11-21 14:47:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809498159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094211233] [2024-11-21 14:47:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:22,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:47:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:22,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:47:22,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:47:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:22,165 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:22,165 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) [2024-11-21 14:47:22,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:22,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:22,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-21 14:47:22,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:22,982 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:22,982 INFO L139 ounterexampleChecker]: Examining path program with hash -510840912, occurence #1 [2024-11-21 14:47:22,982 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:22,982 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:22,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1759331904, now seen corresponding path program 1 times [2024-11-21 14:47:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:22,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325192110] [2024-11-21 14:47:22,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:23,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325192110] [2024-11-21 14:47:23,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325192110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:23,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:23,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:23,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482704677] [2024-11-21 14:47:23,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:23,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:47:23,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:23,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:47:23,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:47:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:23,390 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:23,390 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) [2024-11-21 14:47:23,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:23,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:23,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:47:24,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-21 14:47:24,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:24,880 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:24,880 INFO L139 ounterexampleChecker]: Examining path program with hash -137859505, occurence #1 [2024-11-21 14:47:24,880 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:24,880 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1780804369, now seen corresponding path program 1 times [2024-11-21 14:47:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307680113] [2024-11-21 14:47:24,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:24,918 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:47:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:24,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:47:24,960 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:47:24,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:47:24,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:47:24,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-21 14:47:24,963 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:47:24,963 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:47:24,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-21 14:47:25,008 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-11-21 14:47:25,012 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:25,036 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:47:25,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:47:25,037 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:25,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:47:27,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:27,347 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:27,348 INFO L139 ounterexampleChecker]: Examining path program with hash 25731873, occurence #1 [2024-11-21 14:47:27,348 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:27,348 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1814640328, now seen corresponding path program 1 times [2024-11-21 14:47:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:27,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490091501] [2024-11-21 14:47:27,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490091501] [2024-11-21 14:47:27,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490091501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:27,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:27,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:47:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024286691] [2024-11-21 14:47:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:47:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:27,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:47:27,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:47:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:27,392 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:27,392 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) [2024-11-21 14:47:27,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:33,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-21 14:47:33,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:33,361 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:33,362 INFO L139 ounterexampleChecker]: Examining path program with hash -688896282, occurence #1 [2024-11-21 14:47:33,362 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:33,362 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:33,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1016685027, now seen corresponding path program 1 times [2024-11-21 14:47:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546413020] [2024-11-21 14:47:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546413020] [2024-11-21 14:47:33,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546413020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:33,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:33,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896833810] [2024-11-21 14:47:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:47:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:33,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:47:33,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:47:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:33,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:33,491 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) [2024-11-21 14:47:33,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:33,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-21 14:47:34,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:34,371 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:34,371 INFO L139 ounterexampleChecker]: Examining path program with hash -2142929434, occurence #1 [2024-11-21 14:47:34,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:34,371 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash -135451558, now seen corresponding path program 1 times [2024-11-21 14:47:34,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:34,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129173122] [2024-11-21 14:47:34,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129173122] [2024-11-21 14:47:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129173122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:34,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:34,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070678899] [2024-11-21 14:47:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:34,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:47:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:34,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:47:34,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:47:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:34,673 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:34,674 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) [2024-11-21 14:47:34,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:34,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:34,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:36,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:47:36,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-21 14:47:36,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:36,405 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:36,405 INFO L139 ounterexampleChecker]: Examining path program with hash 43961685, occurence #1 [2024-11-21 14:47:36,405 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:36,405 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:36,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash -154038347, now seen corresponding path program 1 times [2024-11-21 14:47:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125915703] [2024-11-21 14:47:36,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:36,439 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:47:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:36,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:47:36,482 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:47:36,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:47:36,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:47:36,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-21 14:47:36,484 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:47:36,484 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:47:36,484 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-21 14:47:36,521 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-11-21 14:47:36,524 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:36,551 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:47:36,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:47:36,552 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:36,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:47:39,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:39,026 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:39,026 INFO L139 ounterexampleChecker]: Examining path program with hash -560412201, occurence #1 [2024-11-21 14:47:39,026 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:39,026 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:39,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2100171378, now seen corresponding path program 1 times [2024-11-21 14:47:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821792167] [2024-11-21 14:47:39,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821792167] [2024-11-21 14:47:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821792167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:39,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:47:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750211230] [2024-11-21 14:47:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:39,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:47:39,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:39,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:47:39,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:47:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:39,080 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:39,080 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) [2024-11-21 14:47:39,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:45,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-21 14:47:45,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:45,939 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:45,939 INFO L139 ounterexampleChecker]: Examining path program with hash -760666147, occurence #1 [2024-11-21 14:47:45,940 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:45,940 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:45,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash -47144233, now seen corresponding path program 1 times [2024-11-21 14:47:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:45,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826527930] [2024-11-21 14:47:45,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:45,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:46,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826527930] [2024-11-21 14:47:46,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826527930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66984230] [2024-11-21 14:47:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:46,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:47:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:46,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:47:46,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:47:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:46,073 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:46,074 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) [2024-11-21 14:47:46,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:46,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:47,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-21 14:47:47,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:47,217 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:47,217 INFO L139 ounterexampleChecker]: Examining path program with hash -377785752, occurence #1 [2024-11-21 14:47:47,217 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:47,217 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:47,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:47,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1150649009, now seen corresponding path program 1 times [2024-11-21 14:47:47,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:47,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228186025] [2024-11-21 14:47:47,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:47,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228186025] [2024-11-21 14:47:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228186025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:47:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039354337] [2024-11-21 14:47:47,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:47,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:47:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:47,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:47:47,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:47:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:47,519 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:47,519 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) [2024-11-21 14:47:47,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:47,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:47,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:47:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:47:49,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-21 14:47:49,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:49,561 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:49,561 INFO L139 ounterexampleChecker]: Examining path program with hash -1786251857, occurence #1 [2024-11-21 14:47:49,562 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:49,562 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1114626690, now seen corresponding path program 1 times [2024-11-21 14:47:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020037469] [2024-11-21 14:47:49,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:49,607 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:47:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:47:49,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:47:49,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:47:49,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:47:49,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:47:49,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-21 14:47:49,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 14:47:49,654 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:47:49,654 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-21 14:47:49,696 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-11-21 14:47:49,699 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:49,724 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:47:49,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:47:49,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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:47:49,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:47:52,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:47:52,464 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:47:52,464 INFO L139 ounterexampleChecker]: Examining path program with hash 1070798734, occurence #1 [2024-11-21 14:47:52,464 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:47:52,464 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:47:52,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:47:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1486337935, now seen corresponding path program 1 times [2024-11-21 14:47:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:47:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753093151] [2024-11-21 14:47:52,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:47:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:47:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:47:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:47:52,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:47:52,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753093151] [2024-11-21 14:47:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753093151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:47:52,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:47:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:47:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917376087] [2024-11-21 14:47:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:47:52,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:47:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:47:52,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:47:52,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:47:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:47:52,504 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:47:52,504 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) [2024-11-21 14:47:52,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:00,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-21 14:48:00,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:00,388 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:00,388 INFO L139 ounterexampleChecker]: Examining path program with hash 218085213, occurence #1 [2024-11-21 14:48:00,388 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:00,388 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1574485557, now seen corresponding path program 1 times [2024-11-21 14:48:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013463901] [2024-11-21 14:48:00,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013463901] [2024-11-21 14:48:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013463901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:48:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927884100] [2024-11-21 14:48:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:48:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:00,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:48:00,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:48:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:00,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:00,528 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) [2024-11-21 14:48:00,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:00,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:01,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-21 14:48:01,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:01,603 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:01,604 INFO L139 ounterexampleChecker]: Examining path program with hash 915237383, occurence #1 [2024-11-21 14:48:01,604 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:01,604 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:01,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:01,604 INFO L85 PathProgramCache]: Analyzing trace with hash 558511765, now seen corresponding path program 2 times [2024-11-21 14:48:01,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:01,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378621834] [2024-11-21 14:48:01,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:01,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:01,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378621834] [2024-11-21 14:48:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378621834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:01,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:01,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:48:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482453187] [2024-11-21 14:48:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:48:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:01,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:48:01,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:48:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:01,925 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:01,925 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) [2024-11-21 14:48:01,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:01,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:01,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:48:04,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-21 14:48:04,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:04,578 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:04,578 INFO L139 ounterexampleChecker]: Examining path program with hash -841410436, occurence #1 [2024-11-21 14:48:04,578 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:04,578 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:04,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1381085353, now seen corresponding path program 1 times [2024-11-21 14:48:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385534199] [2024-11-21 14:48:04,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:48:04,620 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:48:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:48:04,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:48:04,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:48:04,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:48:04,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:48:04,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-21 14:48:04,675 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:48:04,675 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:48:04,675 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-21 14:48:04,722 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-11-21 14:48:04,726 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:48:04,753 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:48:04,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:48:04,755 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:48:04,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:48:07,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:07,827 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:07,827 INFO L139 ounterexampleChecker]: Examining path program with hash -1247706383, occurence #1 [2024-11-21 14:48:07,828 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:07,828 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:07,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash 913498480, now seen corresponding path program 1 times [2024-11-21 14:48:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301673053] [2024-11-21 14:48:07,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301673053] [2024-11-21 14:48:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301673053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:07,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:07,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:48:07,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706682565] [2024-11-21 14:48:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:07,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:48:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:48:07,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:48:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:07,869 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:07,869 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) [2024-11-21 14:48:07,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:16,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-21 14:48:16,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:16,795 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:16,796 INFO L139 ounterexampleChecker]: Examining path program with hash 1135740637, occurence #1 [2024-11-21 14:48:16,796 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:16,796 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:16,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash 778940902, now seen corresponding path program 1 times [2024-11-21 14:48:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:16,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543381577] [2024-11-21 14:48:16,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:16,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543381577] [2024-11-21 14:48:16,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543381577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:16,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:16,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:48:16,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356917419] [2024-11-21 14:48:16,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:48:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:16,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:48:16,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:48:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:16,933 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:16,934 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) [2024-11-21 14:48:16,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:16,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:18,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-21 14:48:18,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:18,017 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:18,017 INFO L139 ounterexampleChecker]: Examining path program with hash 1743150087, occurence #1 [2024-11-21 14:48:18,017 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:18,017 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 915237622, now seen corresponding path program 2 times [2024-11-21 14:48:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316846367] [2024-11-21 14:48:18,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316846367] [2024-11-21 14:48:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316846367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:48:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731500067] [2024-11-21 14:48:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:18,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:48:18,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:18,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:48:18,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:48:18,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:18,841 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:18,842 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) [2024-11-21 14:48:18,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:18,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:18,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:48:21,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-21 14:48:21,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:21,937 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:21,937 INFO L139 ounterexampleChecker]: Examining path program with hash -478514204, occurence #1 [2024-11-21 14:48:21,937 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:21,937 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:21,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1362454283, now seen corresponding path program 1 times [2024-11-21 14:48:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834567375] [2024-11-21 14:48:21,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:48:21,982 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:48:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:48:22,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:48:22,036 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:48:22,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:48:22,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:48:22,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-21 14:48:22,038 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:48:22,038 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:48:22,038 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-21 14:48:22,083 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-11-21 14:48:22,085 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:48:22,111 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:48:22,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:48:22,112 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:48:22,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:48:25,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:25,542 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:25,542 INFO L139 ounterexampleChecker]: Examining path program with hash -713848418, occurence #1 [2024-11-21 14:48:25,542 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:25,542 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:25,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:25,542 INFO L85 PathProgramCache]: Analyzing trace with hash -682520054, now seen corresponding path program 1 times [2024-11-21 14:48:25,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:25,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219300751] [2024-11-21 14:48:25,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219300751] [2024-11-21 14:48:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219300751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:48:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080208809] [2024-11-21 14:48:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:25,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:48:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:25,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:48:25,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:48:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:25,581 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:25,581 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) [2024-11-21 14:48:25,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:35,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-21 14:48:35,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:35,521 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:35,521 INFO L139 ounterexampleChecker]: Examining path program with hash -9108602, occurence #1 [2024-11-21 14:48:35,521 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:35,521 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:35,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1280806378, now seen corresponding path program 1 times [2024-11-21 14:48:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:35,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32853336] [2024-11-21 14:48:35,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:35,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:35,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:35,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32853336] [2024-11-21 14:48:35,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32853336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:35,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:35,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:48:35,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454003953] [2024-11-21 14:48:35,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:35,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:48:35,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:35,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:48:35,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:48:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:35,701 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:35,701 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) [2024-11-21 14:48:35,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:35,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:36,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-21 14:48:36,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:36,962 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:36,963 INFO L139 ounterexampleChecker]: Examining path program with hash -128407673, occurence #1 [2024-11-21 14:48:36,963 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:36,963 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:36,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1044746942, now seen corresponding path program 2 times [2024-11-21 14:48:36,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:36,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209186057] [2024-11-21 14:48:36,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:36,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:37,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:37,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209186057] [2024-11-21 14:48:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209186057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:48:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731470314] [2024-11-21 14:48:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:37,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:48:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:37,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:48:37,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:48:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:37,261 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:37,261 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) [2024-11-21 14:48:37,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:37,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:37,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:48:40,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-21 14:48:40,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:40,869 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:40,869 INFO L139 ounterexampleChecker]: Examining path program with hash -492722853, occurence #1 [2024-11-21 14:48:40,869 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:40,869 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 472962896, now seen corresponding path program 1 times [2024-11-21 14:48:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416413901] [2024-11-21 14:48:40,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:48:40,914 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:48:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:48:40,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:48:40,974 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:48:40,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:48:40,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:48:40,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-21 14:48:40,978 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:48:40,978 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:48:40,978 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-21 14:48:41,031 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-21 14:48:41,036 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:48:41,068 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:48:41,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:48:41,070 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:48:41,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:48:45,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:45,166 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:45,166 INFO L139 ounterexampleChecker]: Examining path program with hash -896104633, occurence #1 [2024-11-21 14:48:45,166 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:45,166 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:45,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 746570194, now seen corresponding path program 1 times [2024-11-21 14:48:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810033846] [2024-11-21 14:48:45,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:45,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:45,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810033846] [2024-11-21 14:48:45,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810033846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:45,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:45,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:48:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117574534] [2024-11-21 14:48:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:45,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:48:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:45,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:48:45,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:48:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:45,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:45,226 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) [2024-11-21 14:48:45,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-21 14:48:55,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:55,952 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:55,952 INFO L139 ounterexampleChecker]: Examining path program with hash -468291380, occurence #1 [2024-11-21 14:48:55,953 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:55,953 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:55,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1319990017, now seen corresponding path program 1 times [2024-11-21 14:48:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906325601] [2024-11-21 14:48:55,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:56,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:56,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906325601] [2024-11-21 14:48:56,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906325601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:56,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:56,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:48:56,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569103727] [2024-11-21 14:48:56,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:56,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:48:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:56,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:48:56,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:48:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:56,238 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:56,238 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) [2024-11-21 14:48:56,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:56,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:57,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-21 14:48:57,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:48:57,412 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:48:57,413 INFO L139 ounterexampleChecker]: Examining path program with hash 694012848, occurence #1 [2024-11-21 14:48:57,413 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:48:57,413 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:48:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:48:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash -939581503, now seen corresponding path program 2 times [2024-11-21 14:48:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:48:57,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976061485] [2024-11-21 14:48:57,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:48:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:48:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:48:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:48:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:48:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976061485] [2024-11-21 14:48:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976061485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:48:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:48:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:48:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689977674] [2024-11-21 14:48:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:48:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:48:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:48:57,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:48:57,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:48:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:57,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:48:57,740 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) [2024-11-21 14:48:57,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:48:57,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:48:57,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-21 14:49:02,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:02,038 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:02,039 INFO L139 ounterexampleChecker]: Examining path program with hash 1180714224, occurence #1 [2024-11-21 14:49:02,039 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:02,039 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1165419744, now seen corresponding path program 1 times [2024-11-21 14:49:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296883398] [2024-11-21 14:49:02,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:02,080 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:02,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:02,136 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:02,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:02,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:02,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-11-21 14:49:02,138 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:49:02,138 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:02,138 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-11-21 14:49:02,190 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-11-21 14:49:02,194 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:02,230 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:02,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:02,231 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:02,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:06,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:06,608 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:06,608 INFO L139 ounterexampleChecker]: Examining path program with hash 1938830486, occurence #1 [2024-11-21 14:49:06,608 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:06,608 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:06,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 163080687, now seen corresponding path program 1 times [2024-11-21 14:49:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:06,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562599922] [2024-11-21 14:49:06,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562599922] [2024-11-21 14:49:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562599922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:06,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415708961] [2024-11-21 14:49:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:06,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:06,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:06,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:06,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:06,654 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) [2024-11-21 14:49:06,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:18,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-11-21 14:49:18,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:18,329 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:18,329 INFO L139 ounterexampleChecker]: Examining path program with hash -1328045959, occurence #1 [2024-11-21 14:49:18,329 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:18,329 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash 488625174, now seen corresponding path program 1 times [2024-11-21 14:49:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:18,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472696434] [2024-11-21 14:49:18,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:18,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472696434] [2024-11-21 14:49:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472696434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:18,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:18,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:18,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363455852] [2024-11-21 14:49:18,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:18,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:18,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:18,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:18,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:18,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:18,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:18,516 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) [2024-11-21 14:49:18,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:18,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:19,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-11-21 14:49:19,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:19,704 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:19,704 INFO L139 ounterexampleChecker]: Examining path program with hash -1324102151, occurence #1 [2024-11-21 14:49:19,704 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:19,704 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:19,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1149059630, now seen corresponding path program 2 times [2024-11-21 14:49:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524886653] [2024-11-21 14:49:19,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:20,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:20,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524886653] [2024-11-21 14:49:20,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524886653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:20,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:20,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:20,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187011113] [2024-11-21 14:49:20,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:20,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:49:20,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:20,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:49:20,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:49:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:20,288 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:20,289 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) [2024-11-21 14:49:20,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:20,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:20,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-11-21 14:49:24,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:24,626 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:24,626 INFO L139 ounterexampleChecker]: Examining path program with hash -1434851541, occurence #1 [2024-11-21 14:49:24,626 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:24,626 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 752975503, now seen corresponding path program 1 times [2024-11-21 14:49:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914654573] [2024-11-21 14:49:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:24,667 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:24,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:24,725 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:24,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:24,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:24,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-11-21 14:49:24,727 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:49:24,727 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:24,727 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-11-21 14:49:24,786 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-11-21 14:49:24,790 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:24,827 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:24,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:24,828 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:24,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:29,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:29,568 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:29,569 INFO L139 ounterexampleChecker]: Examining path program with hash 2017677597, occurence #1 [2024-11-21 14:49:29,569 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:29,569 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -779585250, now seen corresponding path program 1 times [2024-11-21 14:49:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668292831] [2024-11-21 14:49:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:29,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668292831] [2024-11-21 14:49:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668292831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:29,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367837409] [2024-11-21 14:49:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:29,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:29,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:29,615 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:29,615 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) [2024-11-21 14:49:29,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:42,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-11-21 14:49:42,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:42,676 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:42,676 INFO L139 ounterexampleChecker]: Examining path program with hash -1540766011, occurence #1 [2024-11-21 14:49:42,676 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:42,676 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:42,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2051160626, now seen corresponding path program 1 times [2024-11-21 14:49:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271825148] [2024-11-21 14:49:42,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271825148] [2024-11-21 14:49:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271825148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:49:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739195684] [2024-11-21 14:49:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:42,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:49:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:42,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:49:42,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:49:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:42,864 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:42,865 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) [2024-11-21 14:49:42,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:42,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:44,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-11-21 14:49:44,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:44,245 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:44,245 INFO L139 ounterexampleChecker]: Examining path program with hash -1295664328, occurence #1 [2024-11-21 14:49:44,245 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:44,246 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:44,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash 548734838, now seen corresponding path program 2 times [2024-11-21 14:49:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:44,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662277690] [2024-11-21 14:49:44,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:44,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:44,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662277690] [2024-11-21 14:49:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662277690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:44,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:44,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:49:44,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623515891] [2024-11-21 14:49:44,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:44,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:49:44,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:44,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:49:44,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:49:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,659 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:44,659 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) [2024-11-21 14:49:44,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:44,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:44,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:49:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:49:49,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-11-21 14:49:49,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:49,588 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:49,588 INFO L139 ounterexampleChecker]: Examining path program with hash -1799367995, occurence #1 [2024-11-21 14:49:49,588 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:49,588 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:49,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash -900389851, now seen corresponding path program 1 times [2024-11-21 14:49:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478813414] [2024-11-21 14:49:49,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:49,640 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:49:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:49:49,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:49:49,708 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:49:49,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:49:49,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:49:49,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-11-21 14:49:49,710 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:49:49,710 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:49:49,710 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-11-21 14:49:49,770 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-11-21 14:49:49,775 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:49,810 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:49:49,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:49:49,811 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:49:49,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:49:54,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:49:54,881 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:49:54,881 INFO L139 ounterexampleChecker]: Examining path program with hash 67229812, occurence #1 [2024-11-21 14:49:54,882 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:49:54,882 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:49:54,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:49:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash -173296568, now seen corresponding path program 1 times [2024-11-21 14:49:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:49:54,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251976247] [2024-11-21 14:49:54,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:49:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:49:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:49:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:49:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:49:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251976247] [2024-11-21 14:49:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251976247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:49:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:49:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:49:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595655208] [2024-11-21 14:49:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:49:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:49:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:49:54,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:49:54,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:49:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:49:54,931 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:49:54,931 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) [2024-11-21 14:49:54,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:09,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-11-21 14:50:09,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:09,679 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:09,679 INFO L139 ounterexampleChecker]: Examining path program with hash -1943495826, occurence #1 [2024-11-21 14:50:09,679 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:09,679 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:09,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash -724670991, now seen corresponding path program 1 times [2024-11-21 14:50:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511774840] [2024-11-21 14:50:09,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:09,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511774840] [2024-11-21 14:50:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511774840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:09,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:09,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182130087] [2024-11-21 14:50:09,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:09,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:09,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:09,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:09,882 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:09,883 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) [2024-11-21 14:50:09,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:09,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-11-21 14:50:11,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:11,102 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:11,103 INFO L139 ounterexampleChecker]: Examining path program with hash 929358863, occurence #1 [2024-11-21 14:50:11,103 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:11,103 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1659628953, now seen corresponding path program 2 times [2024-11-21 14:50:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117054910] [2024-11-21 14:50:11,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:11,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:11,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117054910] [2024-11-21 14:50:11,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117054910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:11,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:11,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:11,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414110164] [2024-11-21 14:50:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:11,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:50:11,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:11,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:50:11,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:50:11,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:11,430 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:11,430 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) [2024-11-21 14:50:11,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:11,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:11,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-11-21 14:50:17,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:17,134 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:17,134 INFO L139 ounterexampleChecker]: Examining path program with hash 760194561, occurence #1 [2024-11-21 14:50:17,134 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:17,134 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1806937062, now seen corresponding path program 1 times [2024-11-21 14:50:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046892015] [2024-11-21 14:50:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:17,184 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:17,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:17,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:17,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:17,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:17,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-11-21 14:50:17,264 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:50:17,264 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:17,264 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-11-21 14:50:17,321 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-11-21 14:50:17,325 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:17,365 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:17,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:17,368 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:17,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:22,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:22,938 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:22,938 INFO L139 ounterexampleChecker]: Examining path program with hash -734972749, occurence #1 [2024-11-21 14:50:22,938 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:22,938 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:22,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash 53022168, now seen corresponding path program 1 times [2024-11-21 14:50:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071550217] [2024-11-21 14:50:22,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071550217] [2024-11-21 14:50:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071550217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:22,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:22,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616919604] [2024-11-21 14:50:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:22,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:22,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:22,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:22,992 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:22,992 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) [2024-11-21 14:50:22,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:38,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-11-21 14:50:38,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:38,760 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:38,760 INFO L139 ounterexampleChecker]: Examining path program with hash -1155916530, occurence #1 [2024-11-21 14:50:38,760 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:38,760 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:38,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash -893303314, now seen corresponding path program 1 times [2024-11-21 14:50:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:38,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762799192] [2024-11-21 14:50:38,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:38,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762799192] [2024-11-21 14:50:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762799192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:38,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:50:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498713915] [2024-11-21 14:50:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:50:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:50:38,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:50:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:38,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:38,968 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) [2024-11-21 14:50:38,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:38,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:40,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-11-21 14:50:40,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:40,258 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:40,258 INFO L139 ounterexampleChecker]: Examining path program with hash -1712125312, occurence #1 [2024-11-21 14:50:40,259 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:40,259 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:40,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 119685606, now seen corresponding path program 2 times [2024-11-21 14:50:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:40,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456388594] [2024-11-21 14:50:40,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:40,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:40,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456388594] [2024-11-21 14:50:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456388594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:40,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:40,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:50:40,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027691859] [2024-11-21 14:50:40,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:40,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:50:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:40,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:50:40,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:50:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:40,660 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:40,660 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) [2024-11-21 14:50:40,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:40,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:40,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:50:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:50:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-11-21 14:50:46,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:46,742 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:46,742 INFO L139 ounterexampleChecker]: Examining path program with hash 321709379, occurence #1 [2024-11-21 14:50:46,742 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:46,742 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1700874149, now seen corresponding path program 1 times [2024-11-21 14:50:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:46,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423079627] [2024-11-21 14:50:46,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:46,790 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:50:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:50:46,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:50:46,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:50:46,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:50:46,861 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:50:46,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-11-21 14:50:46,863 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:50:46,864 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:50:46,864 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-11-21 14:50:46,925 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-11-21 14:50:46,930 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:46,968 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:50:46,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:50:46,969 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:50:46,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:50:53,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:50:53,535 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:50:53,535 INFO L139 ounterexampleChecker]: Examining path program with hash 110634984, occurence #1 [2024-11-21 14:50:53,535 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:50:53,535 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:50:53,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:50:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1953706587, now seen corresponding path program 1 times [2024-11-21 14:50:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:50:53,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892174127] [2024-11-21 14:50:53,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:50:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:50:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:50:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:50:53,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:50:53,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892174127] [2024-11-21 14:50:53,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892174127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:50:53,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:50:53,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:50:53,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982671033] [2024-11-21 14:50:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:50:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:50:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:50:53,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:50:53,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:50:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:50:53,590 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:50:53,590 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) [2024-11-21 14:50:53,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:10,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-11-21 14:51:10,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:10,361 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:10,361 INFO L139 ounterexampleChecker]: Examining path program with hash -1990313981, occurence #1 [2024-11-21 14:51:10,361 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:10,361 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:10,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:10,361 INFO L85 PathProgramCache]: Analyzing trace with hash -520434790, now seen corresponding path program 1 times [2024-11-21 14:51:10,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:10,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419471123] [2024-11-21 14:51:10,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:10,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:10,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419471123] [2024-11-21 14:51:10,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419471123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:10,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:10,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:51:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952697263] [2024-11-21 14:51:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:10,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:51:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:10,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:51:10,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:51:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:10,576 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:10,577 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) [2024-11-21 14:51:10,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:10,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:11,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:11,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-11-21 14:51:11,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:11,856 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:11,856 INFO L139 ounterexampleChecker]: Examining path program with hash 532815646, occurence #1 [2024-11-21 14:51:11,856 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:11,856 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:11,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:11,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1476454220, now seen corresponding path program 2 times [2024-11-21 14:51:11,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:11,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214347963] [2024-11-21 14:51:11,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:11,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214347963] [2024-11-21 14:51:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214347963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:12,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:12,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:51:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693187101] [2024-11-21 14:51:12,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:12,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:51:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:12,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:51:12,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:51:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:12,277 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:12,277 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) [2024-11-21 14:51:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:51:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-11-21 14:51:18,874 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:18,874 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:18,874 INFO L139 ounterexampleChecker]: Examining path program with hash -1109883014, occurence #1 [2024-11-21 14:51:18,874 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:18,874 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash 294209927, now seen corresponding path program 1 times [2024-11-21 14:51:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144185271] [2024-11-21 14:51:18,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:18,925 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:51:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:19,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:51:19,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:51:19,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:51:19,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:51:19,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-11-21 14:51:19,011 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:51:19,011 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:51:19,011 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-11-21 14:51:19,060 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-11-21 14:51:19,064 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:19,106 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:51:19,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:51:19,107 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:19,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:51:26,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:26,057 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:26,057 INFO L139 ounterexampleChecker]: Examining path program with hash -1382960081, occurence #1 [2024-11-21 14:51:26,057 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:26,057 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:26,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1247469430, now seen corresponding path program 1 times [2024-11-21 14:51:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:26,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447659023] [2024-11-21 14:51:26,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:26,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:26,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:26,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447659023] [2024-11-21 14:51:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447659023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:26,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:51:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715767680] [2024-11-21 14:51:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:26,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:51:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:26,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:51:26,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:51:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:26,110 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:26,110 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) [2024-11-21 14:51:26,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:44,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-11-21 14:51:44,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:44,255 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:44,255 INFO L139 ounterexampleChecker]: Examining path program with hash -1915752337, occurence #1 [2024-11-21 14:51:44,255 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:44,255 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -766268289, now seen corresponding path program 1 times [2024-11-21 14:51:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948171556] [2024-11-21 14:51:44,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948171556] [2024-11-21 14:51:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948171556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:51:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769686525] [2024-11-21 14:51:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:44,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:51:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:44,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:51:44,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:51:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:44,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:44,508 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) [2024-11-21 14:51:44,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:44,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:45,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-11-21 14:51:45,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:45,838 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:45,839 INFO L139 ounterexampleChecker]: Examining path program with hash -1106125806, occurence #1 [2024-11-21 14:51:45,839 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:45,839 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2120301483, now seen corresponding path program 2 times [2024-11-21 14:51:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802530631] [2024-11-21 14:51:45,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:51:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:51:46,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:51:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802530631] [2024-11-21 14:51:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802530631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:51:46,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:51:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:51:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265435361] [2024-11-21 14:51:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:51:46,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:51:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:51:46,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:51:46,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:51:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:46,251 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:51:46,251 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) [2024-11-21 14:51:46,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:46,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:46,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:51:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:51:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:51:53,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-11-21 14:51:53,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:51:53,664 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:51:53,665 INFO L139 ounterexampleChecker]: Examining path program with hash 63791480, occurence #1 [2024-11-21 14:51:53,665 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:51:53,665 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:51:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:51:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1787312351, now seen corresponding path program 1 times [2024-11-21 14:51:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:51:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316378239] [2024-11-21 14:51:53,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:51:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:51:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:53,721 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:51:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:51:53,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:51:53,809 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:51:53,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:51:53,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:51:53,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-11-21 14:51:53,812 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:51:53,812 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:51:53,812 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-11-21 14:51:53,870 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-11-21 14:51:53,874 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:53,910 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:51:53,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:51:53,910 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:51:53,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:52:01,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:01,506 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:01,507 INFO L139 ounterexampleChecker]: Examining path program with hash -492397380, occurence #1 [2024-11-21 14:52:01,507 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:01,507 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:01,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 255789494, now seen corresponding path program 1 times [2024-11-21 14:52:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:01,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869458728] [2024-11-21 14:52:01,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:01,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:01,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:01,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869458728] [2024-11-21 14:52:01,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869458728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:01,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:01,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:52:01,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747438745] [2024-11-21 14:52:01,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:01,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:52:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:01,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:52:01,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:52:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:01,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:01,562 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) [2024-11-21 14:52:01,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:21,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-11-21 14:52:21,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:21,172 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:21,172 INFO L139 ounterexampleChecker]: Examining path program with hash -1308859478, occurence #1 [2024-11-21 14:52:21,172 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:21,172 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:21,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1071888528, now seen corresponding path program 1 times [2024-11-21 14:52:21,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:21,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222755430] [2024-11-21 14:52:21,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:21,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222755430] [2024-11-21 14:52:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222755430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:52:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479367534] [2024-11-21 14:52:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:21,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:52:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:52:21,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:52:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:21,403 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:21,403 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) [2024-11-21 14:52:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:22,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-11-21 14:52:22,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:22,957 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:22,957 INFO L139 ounterexampleChecker]: Examining path program with hash 389034690, occurence #1 [2024-11-21 14:52:22,957 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:22,958 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:22,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1252724346, now seen corresponding path program 2 times [2024-11-21 14:52:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:22,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894427579] [2024-11-21 14:52:22,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:23,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894427579] [2024-11-21 14:52:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894427579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:23,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:52:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077262363] [2024-11-21 14:52:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:52:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:23,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:52:23,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:52:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:23,366 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:23,367 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) [2024-11-21 14:52:23,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:23,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:23,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:52:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:52:31,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-11-21 14:52:31,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:31,004 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:31,004 INFO L139 ounterexampleChecker]: Examining path program with hash 233401670, occurence #1 [2024-11-21 14:52:31,004 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:31,004 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:31,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash -26022255, now seen corresponding path program 1 times [2024-11-21 14:52:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:31,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891319920] [2024-11-21 14:52:31,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:31,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:31,059 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:52:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:52:31,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:52:31,159 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:52:31,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:52:31,159 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:52:31,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-11-21 14:52:31,162 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:52:31,163 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:52:31,163 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-11-21 14:52:31,231 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-11-21 14:52:31,236 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:31,282 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:52:31,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:52:31,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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:52:31,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:52:39,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:52:39,196 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:52:39,196 INFO L139 ounterexampleChecker]: Examining path program with hash 1556944450, occurence #1 [2024-11-21 14:52:39,196 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:52:39,196 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:52:39,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:52:39,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1224366398, now seen corresponding path program 1 times [2024-11-21 14:52:39,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:52:39,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768815588] [2024-11-21 14:52:39,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:52:39,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:52:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:52:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:52:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:52:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768815588] [2024-11-21 14:52:39,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768815588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:52:39,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:52:39,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:52:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037487857] [2024-11-21 14:52:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:52:39,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:52:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:52:39,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:52:39,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:52:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:52:39,254 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:52:39,254 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) [2024-11-21 14:52:39,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:00,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-11-21 14:53:00,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:00,269 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:00,270 INFO L139 ounterexampleChecker]: Examining path program with hash 1886500024, occurence #1 [2024-11-21 14:53:00,270 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:00,270 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:00,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1082998488, now seen corresponding path program 1 times [2024-11-21 14:53:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941700534] [2024-11-21 14:53:00,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941700534] [2024-11-21 14:53:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941700534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:53:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724926275] [2024-11-21 14:53:00,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:00,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:53:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:00,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:53:00,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:53:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:00,516 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:00,516 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) [2024-11-21 14:53:00,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:00,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:02,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:02,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-11-21 14:53:02,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:02,014 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:02,014 INFO L139 ounterexampleChecker]: Examining path program with hash 1170009843, occurence #1 [2024-11-21 14:53:02,014 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:02,014 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:02,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2122867246, now seen corresponding path program 2 times [2024-11-21 14:53:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416245935] [2024-11-21 14:53:02,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:02,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416245935] [2024-11-21 14:53:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416245935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:53:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774162837] [2024-11-21 14:53:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:02,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:53:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:02,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:53:02,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:53:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:02,506 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:02,506 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) [2024-11-21 14:53:02,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:02,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:02,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:10,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:53:10,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-11-21 14:53:10,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:10,948 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:10,948 INFO L139 ounterexampleChecker]: Examining path program with hash 845032133, occurence #1 [2024-11-21 14:53:10,948 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:10,948 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash -894527490, now seen corresponding path program 1 times [2024-11-21 14:53:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343759075] [2024-11-21 14:53:10,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:11,002 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:53:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:11,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:53:11,083 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:53:11,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:53:11,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:53:11,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-11-21 14:53:11,085 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:53:11,085 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:53:11,085 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-11-21 14:53:11,137 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-11-21 14:53:11,140 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:11,180 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:53:11,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:53:11,180 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:11,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:53:19,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:19,613 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:19,613 INFO L139 ounterexampleChecker]: Examining path program with hash 2048321612, occurence #1 [2024-11-21 14:53:19,613 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:19,613 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:19,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1631325425, now seen corresponding path program 1 times [2024-11-21 14:53:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139690723] [2024-11-21 14:53:19,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:19,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139690723] [2024-11-21 14:53:19,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139690723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:19,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:19,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:53:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747120694] [2024-11-21 14:53:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:19,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:53:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:19,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:53:19,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:53:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:19,673 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:19,673 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) [2024-11-21 14:53:19,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:42,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-11-21 14:53:42,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:42,189 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:42,189 INFO L139 ounterexampleChecker]: Examining path program with hash -161076375, occurence #1 [2024-11-21 14:53:42,189 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:42,189 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:42,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -474670593, now seen corresponding path program 1 times [2024-11-21 14:53:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:42,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524078516] [2024-11-21 14:53:42,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:42,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:42,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524078516] [2024-11-21 14:53:42,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524078516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:42,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:42,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:53:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161725164] [2024-11-21 14:53:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:42,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:53:42,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:42,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:53:42,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:53:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:42,645 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:42,646 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) [2024-11-21 14:53:42,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:42,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:44,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-11-21 14:53:44,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:44,033 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:44,033 INFO L139 ounterexampleChecker]: Examining path program with hash -2098389311, occurence #1 [2024-11-21 14:53:44,033 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:44,033 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:44,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 721048097, now seen corresponding path program 2 times [2024-11-21 14:53:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313813213] [2024-11-21 14:53:44,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:53:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:53:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:53:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313813213] [2024-11-21 14:53:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313813213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:53:44,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:53:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:53:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634295387] [2024-11-21 14:53:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:53:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:53:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:53:44,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:53:44,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:53:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:44,603 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:53:44,603 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) [2024-11-21 14:53:44,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:44,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:44,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:53:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:53:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:53:53,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-11-21 14:53:53,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:53:53,797 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:53:53,797 INFO L139 ounterexampleChecker]: Examining path program with hash -1687841420, occurence #1 [2024-11-21 14:53:53,797 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:53:53,797 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:53:53,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:53:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1173929239, now seen corresponding path program 1 times [2024-11-21 14:53:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:53:53,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471880963] [2024-11-21 14:53:53,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:53:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:53:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:53,854 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:53:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:53:53,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:53:53,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:53:53,941 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:53:53,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:53:53,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-11-21 14:53:53,943 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:53:53,943 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:53:53,943 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-11-21 14:53:54,005 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-11-21 14:53:54,012 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:54,057 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:53:54,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:53:54,058 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:53:54,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:54:03,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:03,037 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:03,037 INFO L139 ounterexampleChecker]: Examining path program with hash -1465533509, occurence #1 [2024-11-21 14:54:03,037 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:03,037 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:03,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1940400244, now seen corresponding path program 1 times [2024-11-21 14:54:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534946003] [2024-11-21 14:54:03,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534946003] [2024-11-21 14:54:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534946003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:54:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096305046] [2024-11-21 14:54:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:03,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:54:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:03,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:54:03,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:54:03,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:03,098 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:03,098 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) [2024-11-21 14:54:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:27,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-11-21 14:54:27,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:27,386 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:27,387 INFO L139 ounterexampleChecker]: Examining path program with hash 485819067, occurence #1 [2024-11-21 14:54:27,387 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:27,387 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:27,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 849101337, now seen corresponding path program 1 times [2024-11-21 14:54:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997341287] [2024-11-21 14:54:27,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997341287] [2024-11-21 14:54:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997341287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:27,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:27,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:54:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556417155] [2024-11-21 14:54:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:27,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:54:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:54:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:54:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:27,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:27,654 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) [2024-11-21 14:54:27,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:27,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:29,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-11-21 14:54:29,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:29,049 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:29,049 INFO L139 ounterexampleChecker]: Examining path program with hash 485876316, occurence #1 [2024-11-21 14:54:29,049 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:29,049 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:29,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1096255925, now seen corresponding path program 2 times [2024-11-21 14:54:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:29,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422032925] [2024-11-21 14:54:29,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:29,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422032925] [2024-11-21 14:54:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422032925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:29,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:29,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:54:29,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663387981] [2024-11-21 14:54:29,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:29,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:54:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:29,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:54:29,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:54:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:29,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:29,528 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) [2024-11-21 14:54:29,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:29,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:29,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:54:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:54:40,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-11-21 14:54:40,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:40,469 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:40,469 INFO L139 ounterexampleChecker]: Examining path program with hash -656773224, occurence #1 [2024-11-21 14:54:40,469 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:40,469 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:40,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash 505669688, now seen corresponding path program 1 times [2024-11-21 14:54:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749791026] [2024-11-21 14:54:40,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:54:40,530 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:54:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:54:40,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:54:40,645 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:54:40,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:54:40,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:54:40,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-11-21 14:54:40,647 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:54:40,648 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:54:40,648 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-11-21 14:54:40,702 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-11-21 14:54:40,706 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:54:40,748 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:54:40,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:54:40,749 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:54:40,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:54:50,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:54:50,437 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:54:50,438 INFO L139 ounterexampleChecker]: Examining path program with hash 1577248912, occurence #1 [2024-11-21 14:54:50,438 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:54:50,438 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:54:50,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:54:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1899184712, now seen corresponding path program 1 times [2024-11-21 14:54:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:54:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725311913] [2024-11-21 14:54:50,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:54:50,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:54:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:54:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:54:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:54:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725311913] [2024-11-21 14:54:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725311913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:54:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:54:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:54:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746195498] [2024-11-21 14:54:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:54:50,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:54:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:54:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:54:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:54:50,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:54:50,645 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:54:50,646 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) [2024-11-21 14:54:50,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:16,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-11-21 14:55:16,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:16,964 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:16,965 INFO L139 ounterexampleChecker]: Examining path program with hash 1595204307, occurence #1 [2024-11-21 14:55:16,965 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:16,965 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:16,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash -857268304, now seen corresponding path program 1 times [2024-11-21 14:55:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672257859] [2024-11-21 14:55:16,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:16,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672257859] [2024-11-21 14:55:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672257859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:55:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859757400] [2024-11-21 14:55:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:17,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:55:17,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:17,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:55:17,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:55:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:17,239 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:17,239 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) [2024-11-21 14:55:17,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:17,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:18,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-11-21 14:55:18,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:18,623 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:18,624 INFO L139 ounterexampleChecker]: Examining path program with hash -176696729, occurence #1 [2024-11-21 14:55:18,624 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:18,624 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:18,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 895733980, now seen corresponding path program 2 times [2024-11-21 14:55:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:18,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206774841] [2024-11-21 14:55:18,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:19,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206774841] [2024-11-21 14:55:19,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206774841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:19,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:55:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784634692] [2024-11-21 14:55:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:19,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:55:19,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:19,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:55:19,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:55:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:19,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:19,276 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) [2024-11-21 14:55:19,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:19,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:19,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:55:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:55:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-11-21 14:55:30,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:30,593 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:30,594 INFO L139 ounterexampleChecker]: Examining path program with hash 1483927937, occurence #1 [2024-11-21 14:55:30,594 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:30,594 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:30,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash 260147602, now seen corresponding path program 1 times [2024-11-21 14:55:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:30,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260016432] [2024-11-21 14:55:30,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:55:30,661 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:55:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:55:30,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:55:30,797 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:55:30,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:55:30,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:55:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-11-21 14:55:30,801 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:55:30,802 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:55:30,802 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-11-21 14:55:30,867 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-11-21 14:55:30,872 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:55:30,918 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:55:30,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:55:30,919 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:55:30,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:55:41,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:55:41,222 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:55:41,223 INFO L139 ounterexampleChecker]: Examining path program with hash -268011057, occurence #1 [2024-11-21 14:55:41,223 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:55:41,223 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:55:41,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:55:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1600934254, now seen corresponding path program 1 times [2024-11-21 14:55:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:55:41,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678982490] [2024-11-21 14:55:41,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:55:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:55:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:55:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:55:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:55:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678982490] [2024-11-21 14:55:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678982490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:55:41,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:55:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:55:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65133596] [2024-11-21 14:55:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:55:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:55:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:55:41,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:55:41,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:55:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:55:41,297 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:55:41,297 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) [2024-11-21 14:55:41,298 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:10,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-11-21 14:56:10,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:10,836 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:10,836 INFO L139 ounterexampleChecker]: Examining path program with hash 753781882, occurence #1 [2024-11-21 14:56:10,836 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:10,836 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 988591891, now seen corresponding path program 1 times [2024-11-21 14:56:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175816890] [2024-11-21 14:56:10,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:11,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175816890] [2024-11-21 14:56:11,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175816890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:11,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:11,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:56:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113244498] [2024-11-21 14:56:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:11,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:56:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:11,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:56:11,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:56:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:11,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:11,128 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) [2024-11-21 14:56:11,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:11,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:12,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:12,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-11-21 14:56:12,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:12,724 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:12,724 INFO L139 ounterexampleChecker]: Examining path program with hash -1512929678, occurence #1 [2024-11-21 14:56:12,724 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:12,724 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1161579709, now seen corresponding path program 2 times [2024-11-21 14:56:12,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214690156] [2024-11-21 14:56:12,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:13,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:13,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214690156] [2024-11-21 14:56:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214690156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:56:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132722783] [2024-11-21 14:56:13,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:13,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 14:56:13,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:13,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 14:56:13,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 14:56:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:13,296 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:13,296 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) [2024-11-21 14:56:13,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:13,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:13,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:56:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:56:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-11-21 14:56:25,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:25,204 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:25,204 INFO L139 ounterexampleChecker]: Examining path program with hash -1642039005, occurence #1 [2024-11-21 14:56:25,205 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:25,205 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1133481194, now seen corresponding path program 1 times [2024-11-21 14:56:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734921006] [2024-11-21 14:56:25,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:56:25,345 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:56:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:56:25,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:56:25,683 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:56:25,683 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:56:25,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:56:25,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-11-21 14:56:25,687 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:56:25,689 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:56:25,689 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-11-21 14:56:25,765 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-11-21 14:56:25,770 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:56:25,860 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:56:25,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:56:25,861 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:56:25,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:56:37,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:56:37,296 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:56:37,296 INFO L139 ounterexampleChecker]: Examining path program with hash 1795461524, occurence #1 [2024-11-21 14:56:37,296 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:56:37,296 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:56:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:56:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1162507049, now seen corresponding path program 1 times [2024-11-21 14:56:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:56:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113477809] [2024-11-21 14:56:37,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:56:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:56:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:56:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:56:37,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:56:37,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113477809] [2024-11-21 14:56:37,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113477809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:56:37,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:56:37,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:56:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222263903] [2024-11-21 14:56:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:56:37,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:56:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:56:37,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:56:37,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:56:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:56:37,367 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:56:37,367 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) [2024-11-21 14:56:37,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:08,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-11-21 14:57:08,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:08,361 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:08,361 INFO L139 ounterexampleChecker]: Examining path program with hash 832750712, occurence #1 [2024-11-21 14:57:08,361 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:08,361 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1382940427, now seen corresponding path program 1 times [2024-11-21 14:57:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787133587] [2024-11-21 14:57:08,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:57:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:57:08,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:57:08,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787133587] [2024-11-21 14:57:08,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787133587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:57:08,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:57:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:57:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899366871] [2024-11-21 14:57:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:57:08,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:57:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:57:08,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:57:08,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:57:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:08,933 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:57:08,933 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) [2024-11-21 14:57:08,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:08,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:10,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-11-21 14:57:10,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:10,889 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:10,890 INFO L139 ounterexampleChecker]: Examining path program with hash -1646550993, occurence #1 [2024-11-21 14:57:10,890 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:10,890 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1508991933, now seen corresponding path program 2 times [2024-11-21 14:57:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103741870] [2024-11-21 14:57:10,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:10,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:57:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:57:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:57:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103741870] [2024-11-21 14:57:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103741870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:57:11,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:57:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:57:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423964501] [2024-11-21 14:57:11,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:57:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:57:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:57:11,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:57:11,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:57:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:11,449 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:57:11,450 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) [2024-11-21 14:57:11,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:11,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:11,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:57:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:57:24,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-11-21 14:57:24,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:24,579 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:24,579 INFO L139 ounterexampleChecker]: Examining path program with hash 121404586, occurence #1 [2024-11-21 14:57:24,579 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:24,579 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:24,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:24,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1451332435, now seen corresponding path program 1 times [2024-11-21 14:57:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519446952] [2024-11-21 14:57:24,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:57:24,649 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:57:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:57:24,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:57:24,761 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:57:24,761 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:57:24,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:57:24,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-11-21 14:57:24,764 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:57:24,765 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:57:24,765 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-11-21 14:57:24,835 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-11-21 14:57:24,839 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:57:24,885 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:57:24,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:57:24,886 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:57:24,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 14:57:36,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:57:36,949 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:57:36,949 INFO L139 ounterexampleChecker]: Examining path program with hash 2096720357, occurence #1 [2024-11-21 14:57:36,949 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:57:36,949 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:57:36,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:57:36,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1257145046, now seen corresponding path program 1 times [2024-11-21 14:57:36,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:57:36,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073454303] [2024-11-21 14:57:36,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:57:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:57:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:57:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:57:37,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:57:37,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073454303] [2024-11-21 14:57:37,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073454303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:57:37,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:57:37,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 14:57:37,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835923604] [2024-11-21 14:57:37,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:57:37,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 14:57:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:57:37,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 14:57:37,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 14:57:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:57:37,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:57:37,023 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) [2024-11-21 14:57:37,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-11-21 14:58:11,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:11,525 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:11,525 INFO L139 ounterexampleChecker]: Examining path program with hash 281134097, occurence #1 [2024-11-21 14:58:11,525 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:11,525 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 608862355, now seen corresponding path program 1 times [2024-11-21 14:58:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371032222] [2024-11-21 14:58:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:58:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:58:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:58:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371032222] [2024-11-21 14:58:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371032222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:58:11,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:58:11,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 14:58:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537516850] [2024-11-21 14:58:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:58:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 14:58:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:58:11,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 14:58:11,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 14:58:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:11,913 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:58:11,913 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) [2024-11-21 14:58:11,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:11,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:58:13,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-11-21 14:58:13,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:13,568 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:13,569 INFO L139 ounterexampleChecker]: Examining path program with hash -2138433418, occurence #1 [2024-11-21 14:58:13,569 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:13,569 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:13,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 974583065, now seen corresponding path program 2 times [2024-11-21 14:58:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:13,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533326459] [2024-11-21 14:58:13,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 14:58:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 14:58:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 14:58:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533326459] [2024-11-21 14:58:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533326459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 14:58:14,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 14:58:14,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 14:58:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365232219] [2024-11-21 14:58:14,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 14:58:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 14:58:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 14:58:14,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 14:58:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 14:58:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:14,282 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 14:58:14,282 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) [2024-11-21 14:58:14,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:14,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:58:14,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 14:58:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 14:58:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 14:58:28,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-11-21 14:58:28,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 14:58:28,431 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 14:58:28,431 INFO L139 ounterexampleChecker]: Examining path program with hash -404523036, occurence #1 [2024-11-21 14:58:28,431 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 14:58:28,431 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 14:58:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 14:58:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -489139977, now seen corresponding path program 1 times [2024-11-21 14:58:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 14:58:28,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537986734] [2024-11-21 14:58:28,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 14:58:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 14:58:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:58:28,505 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 14:58:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 14:58:28,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 14:58:28,668 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 14:58:28,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 14:58:28,669 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 14:58:28,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-11-21 14:58:28,672 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 14:58:28,673 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 14:58:28,673 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-11-21 14:58:28,753 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-11-21 14:58:28,758 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:58:28,814 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 14:58:28,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 14:58:28,815 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;@21590f45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 14:58:28,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. Killed by 15