./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/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_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca --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-6497de0 [2024-11-23 11:36:17,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 11:36:17,603 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-23 11:36:17,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 11:36:17,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 11:36:17,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 11:36:17,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 11:36:17,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 11:36:17,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 11:36:17,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 11:36:17,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 11:36:17,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 11:36:17,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 11:36:17,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 11:36:17,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-23 11:36:17,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 11:36:17,641 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-23 11:36:17,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 11:36:17,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 11:36:17,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-23 11:36:17,642 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-23 11:36:17,642 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-23 11:36:17,642 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_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca 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-23 11:36:17,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 11:36:17,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 11:36:17,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 11:36:17,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 11:36:17,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 11:36:17,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/../../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2024-11-23 11:36:21,057 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/data/ec1a8ab5d/5193c690928447ddb4ac6cef5f73aa00/FLAG8c1d36f0c [2024-11-23 11:36:21,456 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 11:36:21,457 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2024-11-23 11:36:21,477 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/data/ec1a8ab5d/5193c690928447ddb4ac6cef5f73aa00/FLAG8c1d36f0c [2024-11-23 11:36:21,504 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/data/ec1a8ab5d/5193c690928447ddb4ac6cef5f73aa00 [2024-11-23 11:36:21,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 11:36:21,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 11:36:21,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 11:36:21,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 11:36:21,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 11:36:21,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:21" (1/1) ... [2024-11-23 11:36:21,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7858b86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:21, skipping insertion in model container [2024-11-23 11:36:21,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:36:21" (1/1) ... [2024-11-23 11:36:21,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 11:36:21,981 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_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i[30176,30189] [2024-11-23 11:36:22,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 11:36:22,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 11:36:22,073 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_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i[30176,30189] [2024-11-23 11:36:22,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 11:36:22,118 INFO L204 MainTranslator]: Completed translation [2024-11-23 11:36:22,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22 WrapperNode [2024-11-23 11:36:22,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 11:36:22,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 11:36:22,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 11:36:22,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 11:36:22,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,161 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-23 11:36:22,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 11:36:22,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 11:36:22,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 11:36:22,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 11:36:22,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 11:36:22,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 11:36:22,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 11:36:22,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 11:36:22,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (1/1) ... [2024-11-23 11:36:22,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-23 11:36:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/z3 [2024-11-23 11:36:22,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-23 11:36:22,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-23 11:36:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-23 11:36:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-23 11:36:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-23 11:36:22,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 11:36:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 11:36:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-23 11:36:22,259 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-23 11:36:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 11:36:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-23 11:36:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-23 11:36:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 11:36:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 11:36:22,261 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 11:36:22,430 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 11:36:22,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 11:36:22,748 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 11:36:22,748 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 11:36:22,932 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 11:36:22,932 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-23 11:36:22,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:22 BoogieIcfgContainer [2024-11-23 11:36:22,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 11:36:22,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 11:36:22,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 11:36:22,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 11:36:22,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:36:21" (1/3) ... [2024-11-23 11:36:22,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788e7a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:22, skipping insertion in model container [2024-11-23 11:36:22,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:36:22" (2/3) ... [2024-11-23 11:36:22,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788e7a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:36:22, skipping insertion in model container [2024-11-23 11:36:22,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:36:22" (3/3) ... [2024-11-23 11:36:22,966 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2024-11-23 11:36:22,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 11:36:22,983 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-23 11:36:22,984 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 11:36:23,041 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-23 11:36:23,100 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:23,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-23 11:36:23,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/z3 [2024-11-23 11:36:23,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-23 11:36:23,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cafc5609-89cb-4d15-a2ad-a779bf9fbf7d/bin/ugemcutter-verify-Z6otQMs9Ca/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-23 11:36:23,190 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:23,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:23,221 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:23,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:23,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:23,488 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:23,490 INFO L139 ounterexampleChecker]: Examining path program with hash -282682044, occurence #1 [2024-11-23 11:36:23,490 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:23,490 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 176627475, now seen corresponding path program 1 times [2024-11-23 11:36:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913198833] [2024-11-23 11:36:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:23,657 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:23,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:23,744 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:23,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:23,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:23,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 11:36:23,760 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:23,762 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:23,763 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-23 11:36:23,804 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-23 11:36:23,813 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:23,827 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:23,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:23,828 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:23,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:24,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:24,403 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:24,404 INFO L139 ounterexampleChecker]: Examining path program with hash -1379145958, occurence #1 [2024-11-23 11:36:24,405 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:24,406 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash 660662749, now seen corresponding path program 1 times [2024-11-23 11:36:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:24,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814974486] [2024-11-23 11:36:24,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:24,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:24,488 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:24,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:24,531 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:24,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:24,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:24,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 11:36:24,533 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:24,533 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:24,533 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-23 11:36:24,571 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-23 11:36:24,575 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:24,589 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:24,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:24,591 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:24,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:25,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:25,464 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:25,464 INFO L139 ounterexampleChecker]: Examining path program with hash 1327845694, occurence #1 [2024-11-23 11:36:25,464 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:25,464 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:25,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:25,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1486633900, now seen corresponding path program 1 times [2024-11-23 11:36:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051611357] [2024-11-23 11:36:25,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:25,553 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:25,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:25,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:25,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:25,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 11:36:25,640 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:25,640 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:25,640 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-23 11:36:25,698 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-23 11:36:25,705 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:25,729 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:25,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:25,733 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:25,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:27,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:27,021 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:27,022 INFO L139 ounterexampleChecker]: Examining path program with hash 1801264661, occurence #1 [2024-11-23 11:36:27,022 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:27,022 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:27,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:27,023 INFO L85 PathProgramCache]: Analyzing trace with hash -126165430, now seen corresponding path program 1 times [2024-11-23 11:36:27,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:27,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794074138] [2024-11-23 11:36:27,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:27,102 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:27,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:27,188 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:27,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:27,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:27,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 11:36:27,190 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:27,190 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:27,190 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-23 11:36:27,228 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-23 11:36:27,231 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:27,247 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:27,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:27,248 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:27,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:28,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:28,941 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:28,941 INFO L139 ounterexampleChecker]: Examining path program with hash -1180901696, occurence #1 [2024-11-23 11:36:28,941 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:28,942 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:28,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash 688957329, now seen corresponding path program 1 times [2024-11-23 11:36:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:28,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030454035] [2024-11-23 11:36:28,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:29,024 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:29,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:29,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:29,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:29,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:29,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 11:36:29,079 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:29,079 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:29,079 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-23 11:36:29,118 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-23 11:36:29,124 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:29,146 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:29,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:29,149 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:29,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:31,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:31,501 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:31,502 INFO L139 ounterexampleChecker]: Examining path program with hash 129839801, occurence #1 [2024-11-23 11:36:31,502 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:31,502 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -283255941, now seen corresponding path program 1 times [2024-11-23 11:36:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176347246] [2024-11-23 11:36:31,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:31,648 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:31,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:31,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:31,741 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:31,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:31,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 11:36:31,744 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:31,745 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:31,745 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-23 11:36:31,784 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-11-23 11:36:31,788 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:31,808 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:31,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:31,809 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:31,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:34,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:34,695 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:34,695 INFO L139 ounterexampleChecker]: Examining path program with hash -1670484126, occurence #1 [2024-11-23 11:36:34,696 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:34,696 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:34,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1499983654, now seen corresponding path program 1 times [2024-11-23 11:36:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543917573] [2024-11-23 11:36:34,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:34,782 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:34,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:34,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:34,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:34,840 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:34,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 11:36:34,842 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:34,842 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:34,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-23 11:36:34,883 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-11-23 11:36:34,886 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:34,909 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:34,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:34,910 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:34,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:38,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:38,038 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:38,038 INFO L139 ounterexampleChecker]: Examining path program with hash -2015098003, occurence #1 [2024-11-23 11:36:38,038 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:38,038 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:38,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash 760454400, now seen corresponding path program 1 times [2024-11-23 11:36:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926046105] [2024-11-23 11:36:38,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:38,112 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:38,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:38,179 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:38,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:38,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:38,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 11:36:38,181 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:38,181 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:38,181 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-23 11:36:38,221 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-11-23 11:36:38,226 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:38,248 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:38,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:38,250 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:38,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:42,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:42,059 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:42,059 INFO L139 ounterexampleChecker]: Examining path program with hash 1553816488, occurence #1 [2024-11-23 11:36:42,059 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:42,059 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -333793345, now seen corresponding path program 1 times [2024-11-23 11:36:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184672686] [2024-11-23 11:36:42,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:42,120 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:42,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:42,180 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:42,181 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:42,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:42,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 11:36:42,183 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:42,184 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:42,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-23 11:36:42,265 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-11-23 11:36:42,270 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:42,298 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:42,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:42,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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:42,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:46,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:46,531 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:46,532 INFO L139 ounterexampleChecker]: Examining path program with hash -487550333, occurence #1 [2024-11-23 11:36:46,532 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:46,532 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1086495127, now seen corresponding path program 1 times [2024-11-23 11:36:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:46,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536738772] [2024-11-23 11:36:46,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:46,607 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:46,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:46,697 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:46,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:46,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 11:36:46,701 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:46,701 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:46,701 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-23 11:36:46,747 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-11-23 11:36:46,751 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:46,780 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:46,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:46,781 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:46,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:51,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:51,899 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:51,899 INFO L139 ounterexampleChecker]: Examining path program with hash 1189308834, occurence #1 [2024-11-23 11:36:51,899 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:51,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:51,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2037120304, now seen corresponding path program 1 times [2024-11-23 11:36:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235109901] [2024-11-23 11:36:51,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:51,958 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:52,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:52,032 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:52,033 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:52,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:52,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 11:36:52,036 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:52,036 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:52,036 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-23 11:36:52,087 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-11-23 11:36:52,091 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:52,120 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:52,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:52,121 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:52,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:36:57,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:36:57,916 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:36:57,916 INFO L139 ounterexampleChecker]: Examining path program with hash -727431325, occurence #1 [2024-11-23 11:36:57,916 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:36:57,917 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:36:57,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:36:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1164311622, now seen corresponding path program 1 times [2024-11-23 11:36:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:36:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296223725] [2024-11-23 11:36:57,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:36:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:36:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:57,981 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:36:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:36:58,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:36:58,065 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:36:58,065 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:36:58,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:36:58,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 11:36:58,069 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:36:58,069 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:36:58,069 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-23 11:36:58,127 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-11-23 11:36:58,132 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:58,165 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:36:58,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:36:58,166 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:36:58,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:37:04,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:37:04,974 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:37:04,974 INFO L139 ounterexampleChecker]: Examining path program with hash 1213532357, occurence #1 [2024-11-23 11:37:04,974 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:37:04,974 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:37:04,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:37:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash 147188509, now seen corresponding path program 1 times [2024-11-23 11:37:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:37:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570815234] [2024-11-23 11:37:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:37:04,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:37:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:05,045 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:37:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:05,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:37:05,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:37:05,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:37:05,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:37:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 11:37:05,155 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:37:05,156 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:37:05,156 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-23 11:37:05,228 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-11-23 11:37:05,233 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:05,271 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:37:05,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:37:05,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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:05,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:37:12,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:37:12,880 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:37:12,880 INFO L139 ounterexampleChecker]: Examining path program with hash 818335146, occurence #1 [2024-11-23 11:37:12,880 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:37:12,880 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:37:12,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:37:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1785087015, now seen corresponding path program 1 times [2024-11-23 11:37:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:37:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498631968] [2024-11-23 11:37:12,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:37:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:37:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:12,956 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:37:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:13,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:37:13,079 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:37:13,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:37:13,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:37:13,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 11:37:13,086 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:37:13,086 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:37:13,086 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-23 11:37:13,151 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-11-23 11:37:13,157 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:13,193 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:37:13,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:37:13,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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:13,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:37:21,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:37:21,767 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:37:21,768 INFO L139 ounterexampleChecker]: Examining path program with hash -2098736438, occurence #1 [2024-11-23 11:37:21,768 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:37:21,768 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:37:21,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:37:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash -887808330, now seen corresponding path program 1 times [2024-11-23 11:37:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:37:21,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958296160] [2024-11-23 11:37:21,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:37:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:37:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:21,843 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:37:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:21,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:37:21,953 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:37:21,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:37:21,954 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:37:21,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 11:37:21,958 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:37:21,959 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:37:21,959 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-23 11:37:22,114 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-11-23 11:37:22,123 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:22,166 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:37:22,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:37:22,167 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:22,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:37:31,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:37:31,604 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:37:31,605 INFO L139 ounterexampleChecker]: Examining path program with hash -306080902, occurence #1 [2024-11-23 11:37:31,605 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:37:31,605 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:37:31,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:37:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 367958428, now seen corresponding path program 1 times [2024-11-23 11:37:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:37:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699445961] [2024-11-23 11:37:31,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:37:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:37:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:31,674 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:37:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:31,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:37:31,911 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:37:31,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:37:31,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:37:31,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-23 11:37:31,920 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:37:31,920 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:37:31,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-23 11:37:32,014 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-11-23 11:37:32,023 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:32,075 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:37:32,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:37:32,076 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:32,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:37:43,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:37:43,799 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:37:43,799 INFO L139 ounterexampleChecker]: Examining path program with hash -119749808, occurence #1 [2024-11-23 11:37:43,799 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:37:43,799 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:37:43,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:37:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 81244587, now seen corresponding path program 1 times [2024-11-23 11:37:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:37:43,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699320083] [2024-11-23 11:37:43,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:37:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:37:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:43,882 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:37:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:44,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:37:44,035 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:37:44,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:37:44,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:37:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 11:37:44,038 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:37:44,038 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:37:44,038 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-23 11:37:44,221 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-23 11:37:44,227 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:44,277 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:37:44,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:37:44,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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:44,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:37:56,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:37:56,666 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:37:56,667 INFO L139 ounterexampleChecker]: Examining path program with hash -363815388, occurence #1 [2024-11-23 11:37:56,667 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:37:56,667 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:37:56,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:37:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1226395701, now seen corresponding path program 1 times [2024-11-23 11:37:56,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:37:56,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152195595] [2024-11-23 11:37:56,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:37:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:37:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:56,761 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:37:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:37:56,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:37:56,934 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:37:56,934 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:37:56,935 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:37:56,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 11:37:56,939 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:37:56,939 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:37:56,939 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-11-23 11:37:57,020 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-11-23 11:37:57,027 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:57,072 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:37:57,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:37:57,073 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:37:57,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:38:10,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:38:10,910 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:38:10,910 INFO L139 ounterexampleChecker]: Examining path program with hash 89466896, occurence #1 [2024-11-23 11:38:10,910 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:38:10,910 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:38:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:38:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2814220, now seen corresponding path program 1 times [2024-11-23 11:38:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:38:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695885718] [2024-11-23 11:38:10,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:38:10,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:38:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:38:10,993 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:38:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:38:11,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:38:11,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:38:11,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:38:11,161 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:38:11,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-23 11:38:11,163 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:38:11,163 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:38:11,163 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-11-23 11:38:11,243 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-11-23 11:38:11,250 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:38:11,299 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:38:11,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:38:11,300 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:38:11,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:38:26,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:38:26,749 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:38:26,749 INFO L139 ounterexampleChecker]: Examining path program with hash -991167691, occurence #1 [2024-11-23 11:38:26,749 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:38:26,749 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:38:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:38:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1400751870, now seen corresponding path program 1 times [2024-11-23 11:38:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:38:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51793003] [2024-11-23 11:38:26,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:38:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:38:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:38:26,838 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:38:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:38:27,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:38:27,026 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:38:27,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:38:27,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:38:27,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-23 11:38:27,028 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:38:27,029 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:38:27,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-11-23 11:38:27,110 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-11-23 11:38:27,116 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:38:27,164 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:38:27,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:38:27,165 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:38:27,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:38:45,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:38:45,111 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:38:45,111 INFO L139 ounterexampleChecker]: Examining path program with hash -1277047403, occurence #1 [2024-11-23 11:38:45,111 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:38:45,111 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:38:45,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:38:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash 238132841, now seen corresponding path program 1 times [2024-11-23 11:38:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:38:45,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654038588] [2024-11-23 11:38:45,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:38:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:38:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:38:45,207 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:38:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:38:45,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:38:45,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:38:45,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:38:45,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:38:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-23 11:38:45,566 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:38:45,566 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:38:45,566 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-11-23 11:38:45,662 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-11-23 11:38:45,669 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:38:45,733 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:38:45,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:38:45,734 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:38:45,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:39:05,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:39:05,129 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:39:05,129 INFO L139 ounterexampleChecker]: Examining path program with hash -874144507, occurence #1 [2024-11-23 11:39:05,129 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:39:05,129 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:39:05,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:39:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash -236469613, now seen corresponding path program 1 times [2024-11-23 11:39:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:39:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225759138] [2024-11-23 11:39:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:39:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:39:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:39:05,225 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:39:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:39:05,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:39:05,465 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:39:05,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:39:05,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:39:05,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-23 11:39:05,470 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:39:05,471 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:39:05,471 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-11-23 11:39:05,577 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-11-23 11:39:05,585 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:39:05,639 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:39:05,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:39:05,641 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:39:05,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:39:27,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:39:27,241 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:39:27,242 INFO L139 ounterexampleChecker]: Examining path program with hash -1559490395, occurence #1 [2024-11-23 11:39:27,242 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:39:27,242 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:39:27,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:39:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash -384276398, now seen corresponding path program 1 times [2024-11-23 11:39:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:39:27,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347959857] [2024-11-23 11:39:27,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:39:27,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:39:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:39:27,347 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:39:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:39:27,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:39:27,595 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:39:27,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:39:27,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:39:27,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-23 11:39:27,598 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:39:27,599 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:39:27,599 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-11-23 11:39:27,692 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-11-23 11:39:27,698 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:39:27,761 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:39:27,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:39:27,763 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:39:27,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:39:52,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:39:52,731 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:39:52,732 INFO L139 ounterexampleChecker]: Examining path program with hash 373355414, occurence #1 [2024-11-23 11:39:52,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:39:52,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:39:52,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:39:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 482321400, now seen corresponding path program 1 times [2024-11-23 11:39:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:39:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493243922] [2024-11-23 11:39:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:39:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:39:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:39:52,884 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:39:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:39:53,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:39:53,157 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:39:53,158 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:39:53,158 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:39:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-23 11:39:53,161 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:39:53,161 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:39:53,161 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-11-23 11:39:53,262 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-11-23 11:39:53,269 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:39:53,331 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:39:53,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:39:53,331 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:39:53,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:40:19,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:40:19,833 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:40:19,833 INFO L139 ounterexampleChecker]: Examining path program with hash -1301585743, occurence #1 [2024-11-23 11:40:19,833 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:40:19,833 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:40:19,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:40:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1260061783, now seen corresponding path program 1 times [2024-11-23 11:40:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:40:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219114429] [2024-11-23 11:40:19,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:40:19,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:40:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:40:19,933 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:40:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:40:20,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:40:20,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:40:20,214 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:40:20,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:40:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-23 11:40:20,219 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:40:20,219 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:40:20,219 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-11-23 11:40:20,316 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-11-23 11:40:20,322 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:40:20,376 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:40:20,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:40:20,378 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:40:20,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:40:45,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:40:45,967 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:40:45,967 INFO L139 ounterexampleChecker]: Examining path program with hash 1729796710, occurence #1 [2024-11-23 11:40:45,967 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:40:45,967 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:40:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:40:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1841767617, now seen corresponding path program 1 times [2024-11-23 11:40:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:40:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103693397] [2024-11-23 11:40:45,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:40:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:40:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:40:46,066 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:40:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:40:46,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:40:46,382 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:40:46,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:40:46,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:40:46,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-23 11:40:46,387 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:40:46,387 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:40:46,388 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-11-23 11:40:46,494 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-11-23 11:40:46,500 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:40:46,580 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:40:46,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:40:46,580 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:40:46,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:41:14,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:41:14,762 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:41:14,762 INFO L139 ounterexampleChecker]: Examining path program with hash -1757793084, occurence #1 [2024-11-23 11:41:14,762 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:41:14,762 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:41:14,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:41:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 578002312, now seen corresponding path program 1 times [2024-11-23 11:41:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:41:14,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884890843] [2024-11-23 11:41:14,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:41:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:41:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:41:14,905 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:41:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:41:15,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:41:15,217 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:41:15,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:41:15,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:41:15,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-23 11:41:15,220 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:41:15,220 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:41:15,221 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-11-23 11:41:15,333 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-11-23 11:41:15,340 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:41:15,414 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:41:15,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:41:15,415 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:41:15,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:41:46,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:41:46,614 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:41:46,614 INFO L139 ounterexampleChecker]: Examining path program with hash 913201573, occurence #1 [2024-11-23 11:41:46,614 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:41:46,614 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:41:46,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:41:46,615 INFO L85 PathProgramCache]: Analyzing trace with hash 792192126, now seen corresponding path program 1 times [2024-11-23 11:41:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:41:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687209269] [2024-11-23 11:41:46,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:41:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:41:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:41:46,737 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:41:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:41:47,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:41:47,100 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:41:47,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:41:47,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:41:47,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-23 11:41:47,103 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:41:47,104 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:41:47,104 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-11-23 11:41:47,204 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-11-23 11:41:47,211 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:41:47,277 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:41:47,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:41:47,278 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:41:47,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:42:20,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:42:20,376 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:42:20,377 INFO L139 ounterexampleChecker]: Examining path program with hash 2045565824, occurence #1 [2024-11-23 11:42:20,377 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:42:20,377 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:42:20,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:42:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 460219509, now seen corresponding path program 1 times [2024-11-23 11:42:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:42:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865163442] [2024-11-23 11:42:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:42:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:42:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:42:20,493 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:42:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:42:20,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:42:20,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:42:20,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:42:20,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:42:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-23 11:42:20,781 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:42:20,782 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:42:20,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-11-23 11:42:20,907 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-11-23 11:42:20,914 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:42:20,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:42:20,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:42:20,988 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:42:20,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:42:56,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:42:56,718 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:42:56,718 INFO L139 ounterexampleChecker]: Examining path program with hash -1456786818, occurence #1 [2024-11-23 11:42:56,718 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:42:56,718 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:42:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:42:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash -237624001, now seen corresponding path program 1 times [2024-11-23 11:42:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:42:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316308135] [2024-11-23 11:42:56,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:42:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:42:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:42:56,856 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:42:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:42:57,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:42:57,352 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:42:57,352 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:42:57,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:42:57,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-23 11:42:57,356 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:42:57,356 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:42:57,356 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-11-23 11:42:57,459 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-11-23 11:42:57,468 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:42:57,537 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:42:57,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:42:57,538 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:42:57,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:43:35,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:43:35,807 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:43:35,807 INFO L139 ounterexampleChecker]: Examining path program with hash 1283503928, occurence #1 [2024-11-23 11:43:35,807 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:43:35,807 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:43:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:43:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1306067794, now seen corresponding path program 1 times [2024-11-23 11:43:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:43:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195559153] [2024-11-23 11:43:35,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:43:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:43:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:43:35,974 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:43:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:43:36,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:43:36,444 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:43:36,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:43:36,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:43:36,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-23 11:43:36,453 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:43:36,453 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:43:36,453 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-11-23 11:43:36,579 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-11-23 11:43:36,586 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:43:36,664 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:43:36,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:43:36,665 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:43:36,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:44:18,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:44:18,498 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:44:18,498 INFO L139 ounterexampleChecker]: Examining path program with hash -590403335, occurence #1 [2024-11-23 11:44:18,498 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:44:18,498 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:44:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:44:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash -773675244, now seen corresponding path program 1 times [2024-11-23 11:44:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:44:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283952229] [2024-11-23 11:44:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:44:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:44:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:44:18,644 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:44:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:44:19,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:44:19,108 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:44:19,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:44:19,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:44:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-23 11:44:19,117 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:44:19,118 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:44:19,118 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-11-23 11:44:19,230 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-11-23 11:44:19,239 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:44:19,322 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:44:19,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:44:19,322 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:44:19,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:45:03,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:45:03,662 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:45:03,662 INFO L139 ounterexampleChecker]: Examining path program with hash -1565391456, occurence #1 [2024-11-23 11:45:03,663 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:45:03,663 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:45:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:45:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1002034627, now seen corresponding path program 1 times [2024-11-23 11:45:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:45:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333450533] [2024-11-23 11:45:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:45:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:45:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:45:03,799 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:45:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:45:04,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:45:04,486 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:45:04,486 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:45:04,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:45:04,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-23 11:45:04,490 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:45:04,491 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:45:04,491 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-11-23 11:45:04,603 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2024-11-23 11:45:04,608 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:45:04,706 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:45:04,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:45:04,707 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:45:04,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:45:49,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:45:49,953 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:45:49,953 INFO L139 ounterexampleChecker]: Examining path program with hash -1735718146, occurence #1 [2024-11-23 11:45:49,954 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:45:49,954 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:45:49,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:45:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 49248141, now seen corresponding path program 1 times [2024-11-23 11:45:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:45:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735449699] [2024-11-23 11:45:49,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:45:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:45:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:45:50,120 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:45:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:45:50,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:45:50,684 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:45:50,684 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:45:50,684 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:45:50,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-23 11:45:50,690 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:45:50,691 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:45:50,691 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-11-23 11:45:50,798 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2024-11-23 11:45:50,806 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:45:50,897 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:45:50,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:45:50,898 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:45:50,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:46:37,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:46:37,741 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:46:37,741 INFO L139 ounterexampleChecker]: Examining path program with hash -422573648, occurence #1 [2024-11-23 11:46:37,741 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:46:37,741 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:46:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:46:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 287501636, now seen corresponding path program 1 times [2024-11-23 11:46:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:46:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753441011] [2024-11-23 11:46:37,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:46:37,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:46:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:46:37,891 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:46:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:46:38,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:46:38,491 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:46:38,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:46:38,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:46:38,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-23 11:46:38,497 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:46:38,497 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:46:38,497 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-11-23 11:46:38,603 INFO L143 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2024-11-23 11:46:38,608 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:46:38,687 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:46:38,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:46:38,687 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:46:38,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:47:27,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:47:27,062 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:47:27,063 INFO L139 ounterexampleChecker]: Examining path program with hash 611400444, occurence #1 [2024-11-23 11:47:27,063 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:47:27,063 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:47:27,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:47:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1734593722, now seen corresponding path program 1 times [2024-11-23 11:47:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:47:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132416612] [2024-11-23 11:47:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:47:27,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:47:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:47:27,253 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:47:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:47:27,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:47:27,856 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:47:27,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:47:27,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:47:27,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-23 11:47:27,864 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:47:27,864 WARN L246 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:47:27,865 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2024-11-23 11:47:28,005 INFO L143 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2024-11-23 11:47:28,014 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:47:28,095 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:47:28,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:47:28,096 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:47:28,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:48:20,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:48:20,653 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:48:20,654 INFO L139 ounterexampleChecker]: Examining path program with hash -1179014264, occurence #1 [2024-11-23 11:48:20,654 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:48:20,654 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:48:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:48:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1766246593, now seen corresponding path program 1 times [2024-11-23 11:48:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:48:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247252590] [2024-11-23 11:48:20,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:48:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:48:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:48:20,788 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:48:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:48:21,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:48:21,580 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:48:21,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:48:21,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:48:21,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-23 11:48:21,587 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:48:21,588 WARN L246 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:48:21,588 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2024-11-23 11:48:21,829 INFO L143 ThreadInstanceAdder]: Constructed 38 joinOtherThreadTransitions. [2024-11-23 11:48:21,833 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:48:21,927 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:48:21,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:48:21,928 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:48:21,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-23 11:49:18,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-23 11:49:18,133 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-23 11:49:18,133 INFO L139 ounterexampleChecker]: Examining path program with hash -1978220438, occurence #1 [2024-11-23 11:49:18,133 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-23 11:49:18,133 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-23 11:49:18,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 11:49:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash 715643947, now seen corresponding path program 1 times [2024-11-23 11:49:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 11:49:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926555686] [2024-11-23 11:49:18,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 11:49:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 11:49:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:49:18,326 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 11:49:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 11:49:19,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 11:49:19,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 11:49:19,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-23 11:49:19,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-23 11:49:19,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-23 11:49:19,030 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 11:49:19,030 WARN L246 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 11:49:19,030 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2024-11-23 11:49:19,329 INFO L143 ThreadInstanceAdder]: Constructed 39 joinOtherThreadTransitions. [2024-11-23 11:49:19,333 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:49:19,421 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-23 11:49:19,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-23 11:49:19,421 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;@13ceca84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 11:49:19,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.