./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco --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 b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 06:34:03,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 06:34:03,148 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-27 06:34:03,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 06:34:03,158 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 06:34:03,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 06:34:03,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 06:34:03,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 06:34:03,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 06:34:03,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 06:34:03,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 06:34:03,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 06:34:03,219 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 06:34:03,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 06:34:03,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 06:34:03,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 06:34:03,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 06:34:03,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 06:34:03,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 06:34:03,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 06:34:03,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 06:34:03,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 06:34:03,223 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 06:34:03,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 06:34:03,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 06:34:03,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 06:34:03,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 06:34:03,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 06:34:03,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 06:34:03,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 06:34:03,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-27 06:34:03,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 06:34:03,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 06:34:03,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-27 06:34:03,226 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-27 06:34:03,226 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-27 06:34:03,226 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco 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 -> b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 [2024-11-27 06:34:03,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 06:34:03,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 06:34:03,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 06:34:03,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 06:34:03,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 06:34:03,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/../../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2024-11-27 06:34:07,827 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/data/18111715a/eeac099bba034a9badaa4a9c6c898c11/FLAG5905c86f6 [2024-11-27 06:34:08,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 06:34:08,225 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2024-11-27 06:34:08,242 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/data/18111715a/eeac099bba034a9badaa4a9c6c898c11/FLAG5905c86f6 [2024-11-27 06:34:08,260 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/data/18111715a/eeac099bba034a9badaa4a9c6c898c11 [2024-11-27 06:34:08,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 06:34:08,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 06:34:08,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 06:34:08,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 06:34:08,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 06:34:08,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:34:08" (1/1) ... [2024-11-27 06:34:08,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc19805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:08, skipping insertion in model container [2024-11-27 06:34:08,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 06:34:08" (1/1) ... [2024-11-27 06:34:08,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 06:34:08,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i[30176,30189] [2024-11-27 06:34:08,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 06:34:08,932 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 06:34:09,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i[30176,30189] [2024-11-27 06:34:09,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 06:34:09,092 INFO L204 MainTranslator]: Completed translation [2024-11-27 06:34:09,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09 WrapperNode [2024-11-27 06:34:09,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 06:34:09,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 06:34:09,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 06:34:09,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 06:34:09,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,148 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-27 06:34:09,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 06:34:09,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 06:34:09,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 06:34:09,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 06:34:09,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 06:34:09,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 06:34:09,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 06:34:09,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 06:34:09,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (1/1) ... [2024-11-27 06:34:09,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-27 06:34:09,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/z3 [2024-11-27 06:34:09,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-27 06:34:09,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-27 06:34:09,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-27 06:34:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-27 06:34:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-27 06:34:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 06:34:09,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 06:34:09,329 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-27 06:34:09,329 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-27 06:34:09,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 06:34:09,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 06:34:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-27 06:34:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 06:34:09,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 06:34:09,332 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 06:34:09,592 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 06:34:09,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 06:34:09,951 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 06:34:09,951 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 06:34:10,203 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 06:34:10,203 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-27 06:34:10,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:34:10 BoogieIcfgContainer [2024-11-27 06:34:10,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 06:34:10,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 06:34:10,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 06:34:10,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 06:34:10,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 06:34:08" (1/3) ... [2024-11-27 06:34:10,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c971005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:34:10, skipping insertion in model container [2024-11-27 06:34:10,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 06:34:09" (2/3) ... [2024-11-27 06:34:10,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c971005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 06:34:10, skipping insertion in model container [2024-11-27 06:34:10,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 06:34:10" (3/3) ... [2024-11-27 06:34:10,222 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2024-11-27 06:34:10,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 06:34:10,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing.i that has 2 procedures, 61 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2024-11-27 06:34:10,253 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 06:34:10,325 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-27 06:34:10,419 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-27 06:34:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/z3 [2024-11-27 06:34:10,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-27 06:34:10,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b21b8f31-c948-4615-b3cc-b949041f04ad/bin/ugemcutter-verify-fG3NtRWMco/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-27 06:34:10,547 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:10,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:10,600 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:10,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:11,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:11,126 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:11,127 INFO L139 ounterexampleChecker]: Examining path program with hash -282682044, occurence #1 [2024-11-27 06:34:11,131 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:11,131 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 176627475, now seen corresponding path program 1 times [2024-11-27 06:34:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:11,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784449756] [2024-11-27 06:34:11,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:11,422 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:11,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:11,553 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:11,555 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:11,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:11,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 06:34:11,571 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:11,580 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:11,580 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-27 06:34:11,633 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-27 06:34:11,639 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:11,653 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:11,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:11,655 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:11,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:12,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:12,579 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:12,580 INFO L139 ounterexampleChecker]: Examining path program with hash -1379145958, occurence #1 [2024-11-27 06:34:12,580 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:12,580 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 660662749, now seen corresponding path program 1 times [2024-11-27 06:34:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:12,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434688415] [2024-11-27 06:34:12,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:12,654 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:12,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:12,786 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:12,787 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:12,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:12,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 06:34:12,790 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:12,792 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:12,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-27 06:34:12,852 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-27 06:34:12,865 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:12,888 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:12,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:12,892 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:12,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:14,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:14,388 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:14,388 INFO L139 ounterexampleChecker]: Examining path program with hash 1327845694, occurence #1 [2024-11-27 06:34:14,388 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:14,388 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:14,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:14,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1486633900, now seen corresponding path program 1 times [2024-11-27 06:34:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:14,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897459410] [2024-11-27 06:34:14,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:14,555 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:14,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:14,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:14,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:14,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:14,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 06:34:14,676 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:14,677 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:14,677 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-27 06:34:14,723 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-27 06:34:14,728 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:14,773 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:14,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:14,775 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:14,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:16,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:16,763 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:16,763 INFO L139 ounterexampleChecker]: Examining path program with hash 1801264661, occurence #1 [2024-11-27 06:34:16,763 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:16,763 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:16,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:16,766 INFO L85 PathProgramCache]: Analyzing trace with hash -126165430, now seen corresponding path program 1 times [2024-11-27 06:34:16,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:16,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490571153] [2024-11-27 06:34:16,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:16,869 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:16,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:16,955 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:16,955 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:16,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:16,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 06:34:16,963 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:16,964 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:16,964 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-27 06:34:17,039 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-27 06:34:17,051 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:17,075 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:17,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:17,079 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:17,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:19,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:19,797 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:19,798 INFO L139 ounterexampleChecker]: Examining path program with hash -1180901696, occurence #1 [2024-11-27 06:34:19,798 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:19,798 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash 688957329, now seen corresponding path program 1 times [2024-11-27 06:34:19,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598821] [2024-11-27 06:34:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:19,891 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:20,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:20,013 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:20,017 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:20,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:20,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 06:34:20,025 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:20,026 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:20,026 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-27 06:34:20,083 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-27 06:34:20,093 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:20,124 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:20,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:20,126 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:20,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:23,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:23,536 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:23,536 INFO L139 ounterexampleChecker]: Examining path program with hash 129839801, occurence #1 [2024-11-27 06:34:23,537 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:23,537 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:23,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash -283255941, now seen corresponding path program 1 times [2024-11-27 06:34:23,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94860429] [2024-11-27 06:34:23,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:23,673 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:23,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:23,754 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:23,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:23,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 06:34:23,759 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:23,760 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:23,760 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-27 06:34:23,851 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-11-27 06:34:23,863 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:23,893 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:23,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:23,896 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:23,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:27,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:27,998 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:27,999 INFO L139 ounterexampleChecker]: Examining path program with hash -1670484126, occurence #1 [2024-11-27 06:34:27,999 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:27,999 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:27,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1499983654, now seen corresponding path program 1 times [2024-11-27 06:34:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733475788] [2024-11-27 06:34:28,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:28,079 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:28,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:28,177 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:28,177 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:28,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:28,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 06:34:28,183 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:28,184 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:28,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-27 06:34:28,240 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-11-27 06:34:28,247 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:28,274 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:28,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:28,275 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:28,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:32,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:32,928 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:32,928 INFO L139 ounterexampleChecker]: Examining path program with hash -1945761339, occurence #1 [2024-11-27 06:34:32,928 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:32,928 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:32,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash 760454400, now seen corresponding path program 1 times [2024-11-27 06:34:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739854413] [2024-11-27 06:34:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:33,024 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:33,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:33,137 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:33,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:33,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:33,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 06:34:33,144 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:33,145 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:33,145 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-27 06:34:33,252 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-11-27 06:34:33,262 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:33,295 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:33,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:33,298 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:33,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:38,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:38,700 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:38,701 INFO L139 ounterexampleChecker]: Examining path program with hash 1553816488, occurence #1 [2024-11-27 06:34:38,701 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:38,701 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:38,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash -333793345, now seen corresponding path program 1 times [2024-11-27 06:34:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271946575] [2024-11-27 06:34:38,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:38,823 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:38,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:38,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:38,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:38,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:38,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 06:34:38,952 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:38,954 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:38,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-27 06:34:39,019 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-11-27 06:34:39,031 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:39,065 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:39,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:39,067 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:39,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:44,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:44,743 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:44,743 INFO L139 ounterexampleChecker]: Examining path program with hash -487550333, occurence #1 [2024-11-27 06:34:44,743 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:44,743 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:44,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1086495127, now seen corresponding path program 1 times [2024-11-27 06:34:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543512551] [2024-11-27 06:34:44,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:44,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:44,887 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:45,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:45,031 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:45,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:45,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:45,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 06:34:45,037 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:45,038 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:45,039 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-27 06:34:45,127 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-11-27 06:34:45,137 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:45,181 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:45,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:45,183 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:45,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:34:51,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:34:51,972 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:34:51,972 INFO L139 ounterexampleChecker]: Examining path program with hash 412412352, occurence #1 [2024-11-27 06:34:51,973 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:34:51,973 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:34:51,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:34:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2037120304, now seen corresponding path program 1 times [2024-11-27 06:34:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:34:51,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125856553] [2024-11-27 06:34:51,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:34:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:34:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:52,057 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:34:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:34:52,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:34:52,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:34:52,182 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:34:52,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:34:52,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 06:34:52,188 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:34:52,189 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:34:52,191 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-27 06:34:52,267 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-11-27 06:34:52,274 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:52,314 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:34:52,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:34:52,316 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:34:52,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:35:00,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:35:00,350 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:35:00,350 INFO L139 ounterexampleChecker]: Examining path program with hash -727431325, occurence #1 [2024-11-27 06:35:00,351 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:35:00,351 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:35:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:35:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1164311622, now seen corresponding path program 1 times [2024-11-27 06:35:00,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:35:00,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158142438] [2024-11-27 06:35:00,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:35:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:35:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:00,469 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:35:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:00,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:35:00,600 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:35:00,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:35:00,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:35:00,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 06:35:00,609 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:35:00,609 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:35:00,610 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-27 06:35:00,764 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-11-27 06:35:00,772 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:00,816 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:35:00,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:35:00,817 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:00,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:35:10,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:35:10,164 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:35:10,165 INFO L139 ounterexampleChecker]: Examining path program with hash 1213532357, occurence #1 [2024-11-27 06:35:10,165 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:35:10,165 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:35:10,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:35:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash 147188509, now seen corresponding path program 1 times [2024-11-27 06:35:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:35:10,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462967273] [2024-11-27 06:35:10,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:35:10,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:35:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:10,274 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:35:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:10,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:35:10,426 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:35:10,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:35:10,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:35:10,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 06:35:10,432 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:35:10,433 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:35:10,433 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-27 06:35:10,516 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-11-27 06:35:10,522 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:10,571 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:35:10,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:35:10,576 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:10,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:35:20,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:35:20,824 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:35:20,825 INFO L139 ounterexampleChecker]: Examining path program with hash 818335146, occurence #1 [2024-11-27 06:35:20,826 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:35:20,826 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:35:20,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:35:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1785087015, now seen corresponding path program 1 times [2024-11-27 06:35:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:35:20,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185400562] [2024-11-27 06:35:20,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:35:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:35:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:20,945 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:35:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:21,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:35:21,112 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:35:21,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:35:21,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:35:21,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 06:35:21,122 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:35:21,126 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:35:21,126 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-27 06:35:21,217 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-11-27 06:35:21,228 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:21,279 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:35:21,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:35:21,281 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:21,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:35:33,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:35:33,035 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:35:33,035 INFO L139 ounterexampleChecker]: Examining path program with hash 1102888694, occurence #1 [2024-11-27 06:35:33,036 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:35:33,036 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:35:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:35:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -887808330, now seen corresponding path program 1 times [2024-11-27 06:35:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:35:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285473791] [2024-11-27 06:35:33,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:35:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:35:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:33,132 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:35:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:33,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:35:33,403 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:35:33,403 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:35:33,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:35:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 06:35:33,412 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:35:33,413 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:35:33,413 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-27 06:35:33,503 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-11-27 06:35:33,511 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:33,567 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:35:33,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:35:33,570 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:33,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:35:47,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:35:47,038 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:35:47,038 INFO L139 ounterexampleChecker]: Examining path program with hash 120755639, occurence #1 [2024-11-27 06:35:47,038 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:35:47,038 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:35:47,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:35:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash 367958428, now seen corresponding path program 1 times [2024-11-27 06:35:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:35:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219492238] [2024-11-27 06:35:47,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:35:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:35:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:47,191 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:35:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:35:47,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:35:47,439 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:35:47,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:35:47,440 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:35:47,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 06:35:47,446 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:35:47,447 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:35:47,447 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-27 06:35:47,566 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-11-27 06:35:47,579 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:47,643 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:35:47,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:35:47,646 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:35:47,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:36:02,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:36:02,327 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:36:02,327 INFO L139 ounterexampleChecker]: Examining path program with hash -119749808, occurence #1 [2024-11-27 06:36:02,327 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:36:02,327 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:36:02,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:36:02,327 INFO L85 PathProgramCache]: Analyzing trace with hash 81244587, now seen corresponding path program 1 times [2024-11-27 06:36:02,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:36:02,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143655016] [2024-11-27 06:36:02,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:36:02,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:36:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:02,436 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:36:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:02,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:36:02,647 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:36:02,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:36:02,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:36:02,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 06:36:02,654 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:36:02,655 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:36:02,655 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-27 06:36:02,755 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-27 06:36:02,764 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:02,820 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:36:02,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:36:02,822 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:02,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:36:19,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:36:19,636 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:36:19,637 INFO L139 ounterexampleChecker]: Examining path program with hash -363815388, occurence #1 [2024-11-27 06:36:19,637 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:36:19,637 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:36:19,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:36:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1226395701, now seen corresponding path program 1 times [2024-11-27 06:36:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:36:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76383187] [2024-11-27 06:36:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:36:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:36:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:19,875 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:36:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:20,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:36:20,083 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:36:20,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:36:20,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:36:20,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 06:36:20,090 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:36:20,091 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:36:20,091 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-11-27 06:36:20,195 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-11-27 06:36:20,204 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:20,278 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:36:20,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:36:20,280 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:20,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:36:38,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:36:38,439 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:36:38,439 INFO L139 ounterexampleChecker]: Examining path program with hash 89466896, occurence #1 [2024-11-27 06:36:38,439 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:36:38,439 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:36:38,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:36:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2814220, now seen corresponding path program 1 times [2024-11-27 06:36:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:36:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063437655] [2024-11-27 06:36:38,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:36:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:36:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:38,560 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:36:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:38,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:36:38,976 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:36:38,976 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:36:38,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:36:38,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 06:36:38,982 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:36:38,982 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:36:38,982 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-11-27 06:36:39,091 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-11-27 06:36:39,102 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:39,178 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:36:39,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:36:39,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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:39,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:36:57,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:36:57,483 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:36:57,483 INFO L139 ounterexampleChecker]: Examining path program with hash -991167691, occurence #1 [2024-11-27 06:36:57,483 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:36:57,483 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:36:57,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:36:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1400751870, now seen corresponding path program 1 times [2024-11-27 06:36:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:36:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302679973] [2024-11-27 06:36:57,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:36:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:36:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:57,613 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:36:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:36:57,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:36:57,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:36:57,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:36:57,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:36:57,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 06:36:57,882 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:36:57,882 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:36:57,882 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-11-27 06:36:57,985 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-11-27 06:36:57,992 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:58,051 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:36:58,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:36:58,052 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:36:58,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:37:19,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:37:19,299 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:37:19,299 INFO L139 ounterexampleChecker]: Examining path program with hash 658105871, occurence #1 [2024-11-27 06:37:19,299 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:37:19,299 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:37:19,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:37:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 238132841, now seen corresponding path program 1 times [2024-11-27 06:37:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:37:19,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378120610] [2024-11-27 06:37:19,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:37:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:37:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:37:19,427 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:37:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:37:19,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:37:19,695 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:37:19,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:37:19,695 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:37:19,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 06:37:19,699 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:37:19,700 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:37:19,700 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-11-27 06:37:19,808 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-11-27 06:37:19,817 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:37:19,881 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:37:19,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:37:19,884 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:37:19,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:37:42,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:37:42,934 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:37:42,934 INFO L139 ounterexampleChecker]: Examining path program with hash 1407198852, occurence #1 [2024-11-27 06:37:42,934 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:37:42,934 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:37:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:37:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash -236469613, now seen corresponding path program 1 times [2024-11-27 06:37:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:37:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650497960] [2024-11-27 06:37:42,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:37:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:37:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:37:43,069 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:37:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:37:43,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:37:43,367 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:37:43,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:37:43,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:37:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 06:37:43,373 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:37:43,374 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:37:43,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-11-27 06:37:43,507 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-11-27 06:37:43,521 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:37:43,592 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:37:43,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:37:43,593 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:37:43,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:38:10,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:38:10,711 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:38:10,712 INFO L139 ounterexampleChecker]: Examining path program with hash -1559490395, occurence #1 [2024-11-27 06:38:10,712 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:38:10,712 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:38:10,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:38:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash -384276398, now seen corresponding path program 1 times [2024-11-27 06:38:10,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:38:10,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268348085] [2024-11-27 06:38:10,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:38:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:38:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:38:10,864 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:38:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:38:11,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:38:11,223 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:38:11,223 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:38:11,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:38:11,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 06:38:11,231 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:38:11,232 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:38:11,232 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-11-27 06:38:11,348 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-11-27 06:38:11,357 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:38:11,437 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:38:11,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:38:11,438 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:38:11,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:38:38,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:38:38,502 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:38:38,502 INFO L139 ounterexampleChecker]: Examining path program with hash 988124127, occurence #1 [2024-11-27 06:38:38,502 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:38:38,502 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:38:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:38:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 482321400, now seen corresponding path program 1 times [2024-11-27 06:38:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:38:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695159809] [2024-11-27 06:38:38,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:38:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:38:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:38:38,650 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:38:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:38:39,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:38:39,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:38:39,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:38:39,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:38:39,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 06:38:39,020 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:38:39,020 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:38:39,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-11-27 06:38:39,137 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-11-27 06:38:39,146 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:38:39,221 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:38:39,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:38:39,222 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:38:39,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:39:09,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:39:09,201 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:39:09,202 INFO L139 ounterexampleChecker]: Examining path program with hash -1301585743, occurence #1 [2024-11-27 06:39:09,202 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:39:09,202 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:39:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:39:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1260061783, now seen corresponding path program 1 times [2024-11-27 06:39:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:39:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229995148] [2024-11-27 06:39:09,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:39:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:39:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:39:09,356 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:39:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:39:09,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:39:09,770 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:39:09,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:39:09,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:39:09,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 06:39:09,781 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:39:09,782 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:39:09,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-11-27 06:39:09,909 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-11-27 06:39:09,920 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:39:09,996 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:39:09,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:39:09,997 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:39:09,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:39:41,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:39:41,971 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:39:41,972 INFO L139 ounterexampleChecker]: Examining path program with hash -1022874372, occurence #1 [2024-11-27 06:39:41,972 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:39:41,972 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:39:41,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:39:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1841767617, now seen corresponding path program 1 times [2024-11-27 06:39:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:39:41,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049986450] [2024-11-27 06:39:41,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:39:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:39:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:39:42,153 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:39:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:39:42,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:39:42,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:39:42,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:39:42,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:39:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 06:39:42,595 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:39:42,596 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:39:42,596 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-11-27 06:39:42,755 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-11-27 06:39:42,765 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:39:42,848 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:39:42,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:39:42,849 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:39:42,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:40:15,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:40:15,801 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:40:15,802 INFO L139 ounterexampleChecker]: Examining path program with hash 2116536384, occurence #1 [2024-11-27 06:40:15,802 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:40:15,802 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:40:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:40:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 578002312, now seen corresponding path program 1 times [2024-11-27 06:40:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:40:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055324769] [2024-11-27 06:40:15,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:40:15,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:40:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:40:15,942 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:40:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:40:16,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:40:16,362 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:40:16,362 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:40:16,362 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:40:16,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 06:40:16,368 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:40:16,369 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:40:16,369 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-11-27 06:40:16,501 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-11-27 06:40:16,509 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:40:16,597 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:40:16,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:40:16,599 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:40:16,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:40:49,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:40:49,518 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:40:49,518 INFO L139 ounterexampleChecker]: Examining path program with hash 913201573, occurence #1 [2024-11-27 06:40:49,518 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:40:49,519 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:40:49,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:40:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 792192126, now seen corresponding path program 1 times [2024-11-27 06:40:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:40:49,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369696207] [2024-11-27 06:40:49,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:40:49,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:40:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:40:49,667 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:40:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:40:50,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:40:50,205 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:40:50,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:40:50,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:40:50,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 06:40:50,211 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:40:50,212 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:40:50,212 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-11-27 06:40:50,323 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-11-27 06:40:50,328 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:40:50,421 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:40:50,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:40:50,422 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:40:50,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:41:21,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:41:21,586 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:41:21,586 INFO L139 ounterexampleChecker]: Examining path program with hash -606552797, occurence #1 [2024-11-27 06:41:21,586 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:41:21,586 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:41:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:41:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash 460219509, now seen corresponding path program 1 times [2024-11-27 06:41:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:41:21,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494280747] [2024-11-27 06:41:21,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:41:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:41:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:41:21,695 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:41:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:41:22,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:41:22,067 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:41:22,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:41:22,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:41:22,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-27 06:41:22,071 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:41:22,071 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:41:22,071 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-11-27 06:41:22,170 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-11-27 06:41:22,178 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:41:22,253 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:41:22,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:41:22,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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:41:22,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:41:56,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:41:56,611 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:41:56,611 INFO L139 ounterexampleChecker]: Examining path program with hash -374090300, occurence #1 [2024-11-27 06:41:56,611 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:41:56,611 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:41:56,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:41:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -237624001, now seen corresponding path program 1 times [2024-11-27 06:41:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:41:56,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753691386] [2024-11-27 06:41:56,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:41:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:41:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:41:56,750 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:41:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:41:57,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:41:57,410 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:41:57,410 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:41:57,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:41:57,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 06:41:57,414 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:41:57,414 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:41:57,414 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-11-27 06:41:57,510 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-11-27 06:41:57,517 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:41:57,604 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:41:57,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:41:57,604 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:41:57,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:42:34,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:42:34,818 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:42:34,819 INFO L139 ounterexampleChecker]: Examining path program with hash 385061595, occurence #1 [2024-11-27 06:42:34,819 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:42:34,819 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:42:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:42:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1306067794, now seen corresponding path program 1 times [2024-11-27 06:42:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:42:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858296247] [2024-11-27 06:42:34,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:42:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:42:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:42:35,137 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:42:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:42:35,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:42:35,742 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:42:35,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:42:35,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:42:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 06:42:35,762 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:42:35,762 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:42:35,762 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-11-27 06:42:35,935 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-11-27 06:42:35,944 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:42:36,032 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:42:36,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:42:36,033 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:42:36,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:43:16,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:43:16,283 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:43:16,284 INFO L139 ounterexampleChecker]: Examining path program with hash 1597464191, occurence #1 [2024-11-27 06:43:16,284 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:43:16,284 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:43:16,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:43:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash -773675244, now seen corresponding path program 1 times [2024-11-27 06:43:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:43:16,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411189904] [2024-11-27 06:43:16,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:43:16,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:43:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:43:16,455 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:43:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:43:17,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:43:17,079 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:43:17,080 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:43:17,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:43:17,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-27 06:43:17,091 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:43:17,092 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:43:17,092 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-11-27 06:43:17,211 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-11-27 06:43:17,218 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:43:17,309 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:43:17,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:43:17,310 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:43:17,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:44:00,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:44:00,450 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:44:00,451 INFO L139 ounterexampleChecker]: Examining path program with hash -1565391456, occurence #1 [2024-11-27 06:44:00,451 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:44:00,451 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:44:00,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:44:00,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1002034627, now seen corresponding path program 1 times [2024-11-27 06:44:00,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:44:00,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125803892] [2024-11-27 06:44:00,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:44:00,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:44:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:44:00,625 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:44:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:44:01,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:44:01,083 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:44:01,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:44:01,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:44:01,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-27 06:44:01,089 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:44:01,089 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:44:01,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-11-27 06:44:01,206 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2024-11-27 06:44:01,212 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:44:01,474 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:44:01,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:44:01,475 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:44:01,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:44:47,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:44:47,172 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:44:47,172 INFO L139 ounterexampleChecker]: Examining path program with hash -1735718146, occurence #1 [2024-11-27 06:44:47,172 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:44:47,173 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:44:47,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:44:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash 49248141, now seen corresponding path program 1 times [2024-11-27 06:44:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:44:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816943937] [2024-11-27 06:44:47,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:44:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:44:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:44:47,349 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:44:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:44:47,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:44:47,971 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:44:47,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:44:47,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:44:47,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-27 06:44:47,978 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:44:47,978 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:44:47,978 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-11-27 06:44:48,097 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2024-11-27 06:44:48,105 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:44:48,193 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:44:48,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:44:48,194 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:44:48,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:45:37,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:45:37,081 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:45:37,081 INFO L139 ounterexampleChecker]: Examining path program with hash -422573648, occurence #1 [2024-11-27 06:45:37,081 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:45:37,081 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:45:37,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:45:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 287501636, now seen corresponding path program 1 times [2024-11-27 06:45:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:45:37,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8772226] [2024-11-27 06:45:37,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:45:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:45:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:45:37,258 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:45:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:45:37,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:45:37,888 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:45:37,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:45:37,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:45:37,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 06:45:37,895 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:45:37,895 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:45:37,895 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-11-27 06:45:38,018 INFO L143 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2024-11-27 06:45:38,025 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:45:38,128 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:45:38,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:45:38,128 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:45:38,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:46:29,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:46:29,136 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:46:29,136 INFO L139 ounterexampleChecker]: Examining path program with hash -534524625, occurence #1 [2024-11-27 06:46:29,136 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:46:29,136 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:46:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:46:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1734593722, now seen corresponding path program 1 times [2024-11-27 06:46:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:46:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317295620] [2024-11-27 06:46:29,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:46:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:46:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:46:29,304 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:46:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:46:29,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:46:29,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:46:29,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:46:29,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:46:29,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-27 06:46:29,947 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:46:29,948 WARN L246 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:46:29,948 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2024-11-27 06:46:30,062 INFO L143 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2024-11-27 06:46:30,067 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:46:30,153 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:46:30,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:46:30,153 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:46:30,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-27 06:47:19,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-27 06:47:19,909 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-27 06:47:19,909 INFO L139 ounterexampleChecker]: Examining path program with hash -1179014264, occurence #1 [2024-11-27 06:47:19,909 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-27 06:47:19,909 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-27 06:47:19,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 06:47:19,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1766246593, now seen corresponding path program 1 times [2024-11-27 06:47:19,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 06:47:19,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796763818] [2024-11-27 06:47:19,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 06:47:19,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 06:47:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:47:20,119 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 06:47:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 06:47:20,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 06:47:20,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 06:47:20,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-27 06:47:20,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-27 06:47:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-27 06:47:20,874 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-27 06:47:20,875 WARN L246 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 06:47:20,875 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2024-11-27 06:47:21,000 INFO L143 ThreadInstanceAdder]: Constructed 38 joinOtherThreadTransitions. [2024-11-27 06:47:21,006 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:47:21,096 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-27 06:47:21,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-27 06:47:21,097 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;@7710cef5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 06:47:21,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.