./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/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_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 08:15:43,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 08:15:43,454 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-05 08:15:43,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 08:15:43,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-05 08:15:43,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 08:15:43,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-05 08:15:43,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-05 08:15:43,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 08:15:43,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-05 08:15:43,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 08:15:43,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 08:15:43,486 INFO L153 SettingsManager]: * Use SBE=true [2024-12-05 08:15:43,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 08:15:43,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 08:15:43,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 08:15:43,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 08:15:43,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 08:15:43,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 08:15:43,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 08:15:43,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 08:15:43,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-05 08:15:43,489 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-05 08:15:43,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 08:15:43,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-05 08:15:43,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-05 08:15:43,489 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-05 08:15:43,489 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-05 08:15:43,489 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_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX 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-12-05 08:15:43,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 08:15:43,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 08:15:43,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 08:15:43,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 08:15:43,742 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 08:15:43,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/../../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2024-12-05 08:15:46,417 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/data/c4c5d37b4/5533a2b04ef44f8dad9d8185fbaf5dbe/FLAGaf26e66ba [2024-12-05 08:15:46,665 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 08:15:46,666 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2024-12-05 08:15:46,679 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/data/c4c5d37b4/5533a2b04ef44f8dad9d8185fbaf5dbe/FLAGaf26e66ba [2024-12-05 08:15:46,693 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/data/c4c5d37b4/5533a2b04ef44f8dad9d8185fbaf5dbe [2024-12-05 08:15:46,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 08:15:46,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 08:15:46,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 08:15:46,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 08:15:46,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 08:15:46,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:15:46" (1/1) ... [2024-12-05 08:15:46,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5e6cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:46, skipping insertion in model container [2024-12-05 08:15:46,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:15:46" (1/1) ... [2024-12-05 08:15:46,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 08:15:46,970 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_005e820d-55de-4342-88b4-fa88512492aa/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i[30176,30189] [2024-12-05 08:15:46,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 08:15:47,004 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 08:15:47,037 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_005e820d-55de-4342-88b4-fa88512492aa/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i[30176,30189] [2024-12-05 08:15:47,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 08:15:47,074 INFO L204 MainTranslator]: Completed translation [2024-12-05 08:15:47,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47 WrapperNode [2024-12-05 08:15:47,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 08:15:47,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 08:15:47,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 08:15:47,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 08:15:47,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,110 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-12-05 08:15:47,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 08:15:47,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 08:15:47,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 08:15:47,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 08:15:47,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 08:15:47,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 08:15:47,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 08:15:47,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 08:15:47,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (1/1) ... [2024-12-05 08:15:47,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-05 08:15:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 08:15:47,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-05 08:15:47,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-05 08:15:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-05 08:15:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-05 08:15:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-12-05 08:15:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 08:15:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 08:15:47,185 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-12-05 08:15:47,186 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-12-05 08:15:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 08:15:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 08:15:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-12-05 08:15:47,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 08:15:47,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 08:15:47,187 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-05 08:15:47,288 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 08:15:47,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 08:15:47,495 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-05 08:15:47,496 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 08:15:47,605 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 08:15:47,606 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2024-12-05 08:15:47,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:15:47 BoogieIcfgContainer [2024-12-05 08:15:47,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 08:15:47,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-05 08:15:47,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-05 08:15:47,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-05 08:15:47,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:15:46" (1/3) ... [2024-12-05 08:15:47,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3962374a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:15:47, skipping insertion in model container [2024-12-05 08:15:47,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:15:47" (2/3) ... [2024-12-05 08:15:47,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3962374a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:15:47, skipping insertion in model container [2024-12-05 08:15:47,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:15:47" (3/3) ... [2024-12-05 08:15:47,615 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2024-12-05 08:15:47,626 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-05 08:15:47,627 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-12-05 08:15:47,627 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-05 08:15:47,667 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-12-05 08:15:47,724 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-05 08:15:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/z3 [2024-12-05 08:15:47,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-05 08:15:47,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_005e820d-55de-4342-88b4-fa88512492aa/bin/ugemcutter-verify-L2ppAeDwQX/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-05 08:15:47,796 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:47,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:47,819 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:47,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:48,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:48,028 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:48,029 INFO L139 ounterexampleChecker]: Examining path program with hash -282682044, occurence #1 [2024-12-05 08:15:48,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:48,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:48,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 176627475, now seen corresponding path program 1 times [2024-12-05 08:15:48,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:48,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072163030] [2024-12-05 08:15:48,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:48,147 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:48,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:48,198 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:48,199 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:48,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:48,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-05 08:15:48,207 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:48,209 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:48,209 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-05 08:15:48,234 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-12-05 08:15:48,238 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:48,246 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:48,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:48,247 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:48,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:48,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:48,643 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:48,644 INFO L139 ounterexampleChecker]: Examining path program with hash -1379145958, occurence #1 [2024-12-05 08:15:48,644 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:48,644 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:48,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 660662749, now seen corresponding path program 1 times [2024-12-05 08:15:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:48,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670454637] [2024-12-05 08:15:48,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:48,687 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:48,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:48,722 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:48,722 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:48,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:48,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-05 08:15:48,724 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:48,724 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:48,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-05 08:15:48,749 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-05 08:15:48,752 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:48,762 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:48,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:48,762 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:48,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:49,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:49,408 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:49,408 INFO L139 ounterexampleChecker]: Examining path program with hash 1327845694, occurence #1 [2024-12-05 08:15:49,408 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:49,408 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1486633900, now seen corresponding path program 1 times [2024-12-05 08:15:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175473967] [2024-12-05 08:15:49,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:49,447 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:49,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:49,483 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:49,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:49,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:49,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-05 08:15:49,485 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:49,485 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:49,485 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-05 08:15:49,515 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-12-05 08:15:49,519 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:49,536 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:49,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:49,537 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:49,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:50,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:50,513 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:50,513 INFO L139 ounterexampleChecker]: Examining path program with hash 1801264661, occurence #1 [2024-12-05 08:15:50,513 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:50,513 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash -126165430, now seen corresponding path program 1 times [2024-12-05 08:15:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598408120] [2024-12-05 08:15:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:50,558 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:50,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:50,602 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:50,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:50,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:50,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-05 08:15:50,604 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:50,605 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:50,605 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-12-05 08:15:50,637 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-12-05 08:15:50,641 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:50,654 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:50,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:50,654 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:50,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:51,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:51,871 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:51,871 INFO L139 ounterexampleChecker]: Examining path program with hash -1180901696, occurence #1 [2024-12-05 08:15:51,871 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:51,871 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 688957329, now seen corresponding path program 1 times [2024-12-05 08:15:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201037663] [2024-12-05 08:15:51,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:51,911 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:51,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:51,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:51,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:51,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-05 08:15:51,954 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:51,954 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:51,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-12-05 08:15:51,981 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-12-05 08:15:51,983 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:51,999 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:52,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:52,000 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:52,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:53,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:53,442 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:53,443 INFO L139 ounterexampleChecker]: Examining path program with hash 596415042, occurence #1 [2024-12-05 08:15:53,443 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:53,443 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:53,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash -283255941, now seen corresponding path program 1 times [2024-12-05 08:15:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:53,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810629959] [2024-12-05 08:15:53,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:53,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:53,485 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:53,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:53,530 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:53,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:53,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:53,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-05 08:15:53,532 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:53,533 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:53,533 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-12-05 08:15:53,562 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-12-05 08:15:53,565 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:53,582 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:53,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:53,583 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:53,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:55,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:55,387 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:55,387 INFO L139 ounterexampleChecker]: Examining path program with hash 1239021266, occurence #1 [2024-12-05 08:15:55,387 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:55,387 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:55,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1499983654, now seen corresponding path program 1 times [2024-12-05 08:15:55,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:55,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686794110] [2024-12-05 08:15:55,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:55,432 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:55,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:55,479 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:55,479 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:55,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-05 08:15:55,480 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:55,481 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:55,481 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-12-05 08:15:55,514 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2024-12-05 08:15:55,518 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:55,534 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:55,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:55,534 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:55,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:15:57,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:15:57,682 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:15:57,682 INFO L139 ounterexampleChecker]: Examining path program with hash -2015098003, occurence #1 [2024-12-05 08:15:57,682 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:15:57,682 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:15:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:15:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 760454400, now seen corresponding path program 1 times [2024-12-05 08:15:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:15:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526729127] [2024-12-05 08:15:57,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:15:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:15:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:57,724 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:15:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:15:57,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:15:57,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:15:57,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:15:57,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:15:57,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-05 08:15:57,779 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:15:57,780 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:15:57,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-12-05 08:15:57,817 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-12-05 08:15:57,820 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:57,837 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:15:57,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:15:57,838 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:15:57,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:00,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:00,440 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:00,440 INFO L139 ounterexampleChecker]: Examining path program with hash 1705780632, occurence #1 [2024-12-05 08:16:00,440 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:00,440 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -333793345, now seen corresponding path program 1 times [2024-12-05 08:16:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379281616] [2024-12-05 08:16:00,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:00,492 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:00,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:00,551 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:00,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:00,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:00,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-05 08:16:00,554 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:00,554 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:00,555 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-12-05 08:16:00,599 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2024-12-05 08:16:00,604 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:00,626 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:00,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:00,627 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:00,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:04,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:04,048 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:04,049 INFO L139 ounterexampleChecker]: Examining path program with hash -487550333, occurence #1 [2024-12-05 08:16:04,049 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:04,049 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1086495127, now seen corresponding path program 1 times [2024-12-05 08:16:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584552565] [2024-12-05 08:16:04,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:04,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:04,118 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:04,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:04,180 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:04,180 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:04,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:04,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-05 08:16:04,183 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:04,183 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:04,183 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-12-05 08:16:04,226 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2024-12-05 08:16:04,231 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:04,257 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:04,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:04,258 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:04,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:08,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:08,017 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:08,017 INFO L139 ounterexampleChecker]: Examining path program with hash -587215413, occurence #1 [2024-12-05 08:16:08,017 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:08,017 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:08,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2037120304, now seen corresponding path program 1 times [2024-12-05 08:16:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118949482] [2024-12-05 08:16:08,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:08,066 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:08,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:08,133 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:08,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:08,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-05 08:16:08,136 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:08,136 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:08,136 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-12-05 08:16:08,182 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2024-12-05 08:16:08,187 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:08,212 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:08,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:08,212 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:08,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:12,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:12,708 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:12,708 INFO L139 ounterexampleChecker]: Examining path program with hash -1155976962, occurence #1 [2024-12-05 08:16:12,708 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:12,708 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:12,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:12,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1164311622, now seen corresponding path program 1 times [2024-12-05 08:16:12,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:12,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20450765] [2024-12-05 08:16:12,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:12,762 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:12,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:12,835 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:12,836 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:12,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-05 08:16:12,839 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:12,839 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:12,839 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-12-05 08:16:12,890 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2024-12-05 08:16:12,894 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:12,922 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:12,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:12,923 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:12,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:18,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:18,050 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:18,050 INFO L139 ounterexampleChecker]: Examining path program with hash 248981495, occurence #1 [2024-12-05 08:16:18,050 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:18,050 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:18,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash 147188509, now seen corresponding path program 1 times [2024-12-05 08:16:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:18,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101293416] [2024-12-05 08:16:18,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:18,093 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:18,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:18,147 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:18,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:18,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:18,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-05 08:16:18,150 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:18,151 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:18,151 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-12-05 08:16:18,246 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2024-12-05 08:16:18,251 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:18,286 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:18,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:18,287 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:18,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:24,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:24,205 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:24,205 INFO L139 ounterexampleChecker]: Examining path program with hash 1310273323, occurence #1 [2024-12-05 08:16:24,205 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:24,205 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:24,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1785087015, now seen corresponding path program 1 times [2024-12-05 08:16:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471652131] [2024-12-05 08:16:24,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:24,258 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:24,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:24,321 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:24,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:24,321 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:24,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-05 08:16:24,323 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:24,323 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:24,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-12-05 08:16:24,377 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2024-12-05 08:16:24,381 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:24,415 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:24,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:24,416 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:24,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:31,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:31,068 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:31,069 INFO L139 ounterexampleChecker]: Examining path program with hash 319914884, occurence #1 [2024-12-05 08:16:31,069 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:31,069 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -887808330, now seen corresponding path program 1 times [2024-12-05 08:16:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26095288] [2024-12-05 08:16:31,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:31,118 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:31,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:31,183 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:31,184 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:31,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:31,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-05 08:16:31,185 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:31,185 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:31,185 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-12-05 08:16:31,239 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2024-12-05 08:16:31,243 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:31,279 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:31,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:31,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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:31,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:39,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:39,011 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:39,011 INFO L139 ounterexampleChecker]: Examining path program with hash 1162583635, occurence #1 [2024-12-05 08:16:39,011 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:39,011 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash 367958428, now seen corresponding path program 1 times [2024-12-05 08:16:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130757978] [2024-12-05 08:16:39,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:39,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:39,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:39,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:39,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:39,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:39,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:39,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-05 08:16:39,127 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:39,127 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:39,127 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-12-05 08:16:39,185 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2024-12-05 08:16:39,188 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:39,228 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:39,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:39,228 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:39,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:47,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:47,945 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:47,945 INFO L139 ounterexampleChecker]: Examining path program with hash 1247917515, occurence #1 [2024-12-05 08:16:47,945 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:47,945 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:47,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 81244587, now seen corresponding path program 1 times [2024-12-05 08:16:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084891892] [2024-12-05 08:16:47,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:48,010 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:48,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:48,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:48,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:48,143 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-05 08:16:48,146 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:48,146 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:48,146 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-12-05 08:16:48,209 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-12-05 08:16:48,215 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:48,253 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:48,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:48,254 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:48,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:16:58,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:16:58,160 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:16:58,160 INFO L139 ounterexampleChecker]: Examining path program with hash 217087783, occurence #1 [2024-12-05 08:16:58,160 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:16:58,160 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:16:58,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:16:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1226395701, now seen corresponding path program 1 times [2024-12-05 08:16:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:16:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465057351] [2024-12-05 08:16:58,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:16:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:16:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:58,213 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:16:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:16:58,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:16:58,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:16:58,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:16:58,364 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:16:58,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-05 08:16:58,366 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:16:58,367 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:16:58,367 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-12-05 08:16:58,441 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2024-12-05 08:16:58,447 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:58,489 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:16:58,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:16:58,489 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:16:58,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:17:09,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:09,753 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:09,753 INFO L139 ounterexampleChecker]: Examining path program with hash -2058842823, occurence #1 [2024-12-05 08:17:09,753 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:09,753 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2814220, now seen corresponding path program 1 times [2024-12-05 08:17:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743197731] [2024-12-05 08:17:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:09,823 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:17:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:09,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:17:09,984 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:17:09,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:17:09,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:17:09,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-05 08:17:09,987 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:17:09,987 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:17:09,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-12-05 08:17:10,065 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2024-12-05 08:17:10,071 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:10,112 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:17:10,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:17:10,113 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:10,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:17:22,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:22,181 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:22,181 INFO L139 ounterexampleChecker]: Examining path program with hash -548699830, occurence #1 [2024-12-05 08:17:22,181 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:22,181 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:22,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1400751870, now seen corresponding path program 1 times [2024-12-05 08:17:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320041242] [2024-12-05 08:17:22,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:22,258 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:17:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:22,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:17:22,417 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:17:22,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:17:22,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:17:22,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-12-05 08:17:22,419 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:17:22,419 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:17:22,419 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-12-05 08:17:22,480 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2024-12-05 08:17:22,485 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:22,530 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:17:22,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:17:22,531 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:22,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:17:35,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:35,646 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:35,646 INFO L139 ounterexampleChecker]: Examining path program with hash -901497607, occurence #1 [2024-12-05 08:17:35,646 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:35,646 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:35,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash 238132841, now seen corresponding path program 1 times [2024-12-05 08:17:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:35,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485985489] [2024-12-05 08:17:35,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:35,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:35,719 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:17:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:35,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:17:35,900 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:17:35,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:17:35,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:17:35,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-12-05 08:17:35,903 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:17:35,903 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:17:35,903 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-12-05 08:17:35,980 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2024-12-05 08:17:35,985 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:36,026 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:17:36,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:17:36,026 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:36,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:17:50,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:17:50,057 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:17:50,057 INFO L139 ounterexampleChecker]: Examining path program with hash -1477388214, occurence #1 [2024-12-05 08:17:50,057 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:17:50,057 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:17:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:17:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash -236469613, now seen corresponding path program 1 times [2024-12-05 08:17:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:17:50,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807304806] [2024-12-05 08:17:50,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:17:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:17:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:50,120 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:17:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:17:50,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:17:50,307 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:17:50,307 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:17:50,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:17:50,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-12-05 08:17:50,310 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:17:50,311 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:17:50,311 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-12-05 08:17:50,383 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2024-12-05 08:17:50,388 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:50,425 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:17:50,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:17:50,426 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:17:50,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:06,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:06,372 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:06,372 INFO L139 ounterexampleChecker]: Examining path program with hash 1761297566, occurence #1 [2024-12-05 08:18:06,372 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:06,372 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:06,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -384276398, now seen corresponding path program 1 times [2024-12-05 08:18:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:06,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420633980] [2024-12-05 08:18:06,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:06,460 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:06,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:06,708 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:06,709 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:06,709 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:06,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-12-05 08:18:06,711 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:18:06,711 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:06,711 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-12-05 08:18:06,776 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2024-12-05 08:18:06,782 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:06,828 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:06,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:06,829 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:06,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:24,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:24,097 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:24,097 INFO L139 ounterexampleChecker]: Examining path program with hash 147240929, occurence #1 [2024-12-05 08:18:24,097 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:24,097 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:24,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash 482321400, now seen corresponding path program 1 times [2024-12-05 08:18:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875528277] [2024-12-05 08:18:24,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:24,166 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:24,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:24,344 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:24,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:24,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:24,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-12-05 08:18:24,346 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:18:24,346 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:24,346 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-12-05 08:18:24,408 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2024-12-05 08:18:24,411 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:24,462 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:24,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:24,463 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:24,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:18:42,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:18:42,621 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:18:42,621 INFO L139 ounterexampleChecker]: Examining path program with hash -445895947, occurence #1 [2024-12-05 08:18:42,621 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:18:42,621 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:18:42,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:18:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1260061783, now seen corresponding path program 1 times [2024-12-05 08:18:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:18:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755502892] [2024-12-05 08:18:42,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:18:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:18:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:42,692 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:18:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:18:42,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:18:42,850 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:18:42,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:18:42,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:18:42,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-12-05 08:18:42,852 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:18:42,852 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:18:42,852 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-12-05 08:18:42,931 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2024-12-05 08:18:42,936 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:42,990 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:18:42,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:18:42,990 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:18:42,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:02,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:02,925 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:02,926 INFO L139 ounterexampleChecker]: Examining path program with hash -1784091597, occurence #1 [2024-12-05 08:19:02,926 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:02,926 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:02,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:02,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1841767617, now seen corresponding path program 1 times [2024-12-05 08:19:02,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:02,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865908178] [2024-12-05 08:19:02,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:03,005 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:03,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:03,262 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:03,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:03,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-12-05 08:19:03,265 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:19:03,265 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:03,265 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-12-05 08:19:03,346 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2024-12-05 08:19:03,351 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:03,415 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:03,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:03,416 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:03,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:24,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:24,684 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:24,684 INFO L139 ounterexampleChecker]: Examining path program with hash -2075791747, occurence #1 [2024-12-05 08:19:24,684 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:24,684 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:24,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash 578002312, now seen corresponding path program 1 times [2024-12-05 08:19:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208015628] [2024-12-05 08:19:24,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:24,767 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:25,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:25,048 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:25,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:25,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:25,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-12-05 08:19:25,050 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:19:25,050 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:25,050 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-12-05 08:19:25,135 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2024-12-05 08:19:25,139 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:25,191 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:25,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:25,192 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:25,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:19:48,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:19:48,200 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:19:48,200 INFO L139 ounterexampleChecker]: Examining path program with hash 1308628911, occurence #1 [2024-12-05 08:19:48,200 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:19:48,200 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:19:48,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:19:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 792192126, now seen corresponding path program 1 times [2024-12-05 08:19:48,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:19:48,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656181630] [2024-12-05 08:19:48,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:19:48,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:19:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:48,284 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:19:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:19:48,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:19:48,623 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:19:48,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:19:48,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:19:48,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-12-05 08:19:48,626 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:19:48,626 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:19:48,626 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-12-05 08:19:48,703 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2024-12-05 08:19:48,707 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:48,751 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:19:48,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:19:48,752 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:19:48,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:14,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:14,187 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:14,187 INFO L139 ounterexampleChecker]: Examining path program with hash 910307751, occurence #1 [2024-12-05 08:20:14,187 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:14,187 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:14,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash 460219509, now seen corresponding path program 1 times [2024-12-05 08:20:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:14,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731297224] [2024-12-05 08:20:14,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:14,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:14,287 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:20:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:14,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:20:14,521 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:20:14,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:20:14,521 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:20:14,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-12-05 08:20:14,524 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:20:14,524 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:20:14,524 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-12-05 08:20:14,603 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2024-12-05 08:20:14,607 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:14,657 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:20:14,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:20:14,658 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:14,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:20:42,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:20:42,115 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:20:42,115 INFO L139 ounterexampleChecker]: Examining path program with hash -2880059, occurence #1 [2024-12-05 08:20:42,115 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:20:42,115 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:20:42,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:20:42,116 INFO L85 PathProgramCache]: Analyzing trace with hash -237624001, now seen corresponding path program 1 times [2024-12-05 08:20:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:20:42,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245918355] [2024-12-05 08:20:42,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:20:42,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:20:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:42,214 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:20:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:20:42,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:20:42,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:20:42,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:20:42,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:20:42,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-12-05 08:20:42,469 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:20:42,470 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:20:42,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-12-05 08:20:42,552 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2024-12-05 08:20:42,556 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:42,606 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:20:42,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:20:42,606 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:20:42,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:21:11,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:11,437 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:11,437 INFO L139 ounterexampleChecker]: Examining path program with hash -1308142083, occurence #1 [2024-12-05 08:21:11,437 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:11,437 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:11,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1306067794, now seen corresponding path program 1 times [2024-12-05 08:21:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737325245] [2024-12-05 08:21:11,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:11,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:11,630 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:21:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:11,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:21:11,914 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:21:11,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:21:11,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:21:11,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-12-05 08:21:11,918 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:21:11,918 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:21:11,918 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-12-05 08:21:11,997 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2024-12-05 08:21:12,001 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:12,059 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:21:12,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:21:12,060 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:12,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:21:42,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:21:42,575 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:21:42,575 INFO L139 ounterexampleChecker]: Examining path program with hash -566493567, occurence #1 [2024-12-05 08:21:42,575 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:21:42,575 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:21:42,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:21:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash -773675244, now seen corresponding path program 1 times [2024-12-05 08:21:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:21:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633976767] [2024-12-05 08:21:42,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:21:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:21:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:42,684 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:21:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:21:42,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:21:42,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:21:42,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:21:42,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:21:42,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-12-05 08:21:42,994 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:21:42,994 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:21:42,994 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-12-05 08:21:43,077 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2024-12-05 08:21:43,083 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:43,141 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:21:43,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:21:43,141 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:21:43,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:22:16,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:16,201 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:16,201 INFO L139 ounterexampleChecker]: Examining path program with hash -823142572, occurence #1 [2024-12-05 08:22:16,201 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:16,201 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1002034627, now seen corresponding path program 1 times [2024-12-05 08:22:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091487127] [2024-12-05 08:22:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:16,322 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:22:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:16,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:22:16,658 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:22:16,658 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:22:16,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:22:16,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-12-05 08:22:16,663 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:22:16,663 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:22:16,663 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2024-12-05 08:22:16,752 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2024-12-05 08:22:16,759 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:16,820 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:22:16,820 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:22:16,820 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:16,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:22:52,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:22:52,836 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:22:52,837 INFO L139 ounterexampleChecker]: Examining path program with hash -1332372971, occurence #1 [2024-12-05 08:22:52,837 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:22:52,837 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:22:52,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:22:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash 49248141, now seen corresponding path program 1 times [2024-12-05 08:22:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:22:52,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436415201] [2024-12-05 08:22:52,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:22:52,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:22:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:52,978 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:22:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:22:53,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:22:53,469 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:22:53,469 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:22:53,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:22:53,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-12-05 08:22:53,473 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:22:53,474 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:22:53,474 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2024-12-05 08:22:53,566 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2024-12-05 08:22:53,573 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:53,637 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:22:53,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:22:53,638 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:22:53,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:23:31,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:23:31,773 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:23:31,774 INFO L139 ounterexampleChecker]: Examining path program with hash 450557753, occurence #1 [2024-12-05 08:23:31,774 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:23:31,774 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:23:31,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:23:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash 287501636, now seen corresponding path program 1 times [2024-12-05 08:23:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:23:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390164424] [2024-12-05 08:23:31,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:23:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:23:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:23:31,908 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:23:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:23:32,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:23:32,605 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:23:32,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:23:32,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:23:32,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-12-05 08:23:32,609 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:23:32,610 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:23:32,610 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2024-12-05 08:23:32,736 INFO L143 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2024-12-05 08:23:32,745 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:23:32,815 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:23:32,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:23:32,815 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:23:32,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:24:12,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:12,767 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:12,767 INFO L139 ounterexampleChecker]: Examining path program with hash -447813309, occurence #1 [2024-12-05 08:24:12,767 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:12,767 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:12,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1734593722, now seen corresponding path program 1 times [2024-12-05 08:24:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777094645] [2024-12-05 08:24:12,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:12,891 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:24:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:13,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:24:13,342 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:24:13,342 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:24:13,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:24:13,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-12-05 08:24:13,347 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:24:13,347 WARN L246 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:24:13,347 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2024-12-05 08:24:13,448 INFO L143 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2024-12-05 08:24:13,452 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:13,515 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:24:13,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:24:13,516 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:13,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:24:55,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:24:55,003 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:24:55,003 INFO L139 ounterexampleChecker]: Examining path program with hash 813035387, occurence #1 [2024-12-05 08:24:55,003 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:24:55,004 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:24:55,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:24:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1766246593, now seen corresponding path program 1 times [2024-12-05 08:24:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:24:55,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492420177] [2024-12-05 08:24:55,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:24:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:24:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:55,130 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:24:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:24:55,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:24:55,583 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:24:55,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:24:55,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:24:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-12-05 08:24:55,588 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:24:55,589 WARN L246 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:24:55,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2024-12-05 08:24:55,689 INFO L143 ThreadInstanceAdder]: Constructed 38 joinOtherThreadTransitions. [2024-12-05 08:24:55,693 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:55,751 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:24:55,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:24:55,752 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:24:55,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:25:39,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:25:39,262 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:25:39,262 INFO L139 ounterexampleChecker]: Examining path program with hash 931369030, occurence #1 [2024-12-05 08:25:39,262 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:25:39,262 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:25:39,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:25:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 715643947, now seen corresponding path program 1 times [2024-12-05 08:25:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:25:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526348067] [2024-12-05 08:25:39,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:25:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:25:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:25:39,511 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:25:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:25:40,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:25:40,023 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:25:40,023 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:25:40,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:25:40,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-12-05 08:25:40,029 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:25:40,030 WARN L246 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:25:40,030 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2024-12-05 08:25:40,166 INFO L143 ThreadInstanceAdder]: Constructed 39 joinOtherThreadTransitions. [2024-12-05 08:25:40,172 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:25:40,274 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:25:40,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:25:40,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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:25:40,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:26:25,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:26:25,953 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:26:25,954 INFO L139 ounterexampleChecker]: Examining path program with hash 1772968425, occurence #1 [2024-12-05 08:26:25,954 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:26:25,954 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:26:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:26:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash 463997130, now seen corresponding path program 1 times [2024-12-05 08:26:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:26:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273239718] [2024-12-05 08:26:25,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:26:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:26:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:26:26,085 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:26:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:26:26,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:26:26,574 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:26:26,574 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:26:26,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:26:26,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-12-05 08:26:26,581 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:26:26,581 WARN L246 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:26:26,581 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2024-12-05 08:26:26,683 INFO L143 ThreadInstanceAdder]: Constructed 40 joinOtherThreadTransitions. [2024-12-05 08:26:26,687 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:26:26,751 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:26:26,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:26:26,752 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:26:26,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:27:15,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:27:15,450 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:27:15,451 INFO L139 ounterexampleChecker]: Examining path program with hash -352360461, occurence #1 [2024-12-05 08:27:15,451 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:27:15,451 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:27:15,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:27:15,451 INFO L85 PathProgramCache]: Analyzing trace with hash 848362608, now seen corresponding path program 1 times [2024-12-05 08:27:15,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:27:15,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33943423] [2024-12-05 08:27:15,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:27:15,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:27:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:27:15,593 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:27:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:27:16,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:27:16,269 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:27:16,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:27:16,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:27:16,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-12-05 08:27:16,276 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:27:16,276 WARN L246 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:27:16,276 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2024-12-05 08:27:16,409 INFO L143 ThreadInstanceAdder]: Constructed 41 joinOtherThreadTransitions. [2024-12-05 08:27:16,415 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:27:16,512 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:27:16,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:27:16,513 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:27:16,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-12-05 08:28:08,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-05 08:28:08,514 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-05 08:28:08,514 INFO L139 ounterexampleChecker]: Examining path program with hash -88237940, occurence #1 [2024-12-05 08:28:08,514 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-05 08:28:08,514 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-05 08:28:08,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 08:28:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -868786449, now seen corresponding path program 1 times [2024-12-05 08:28:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-05 08:28:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181981756] [2024-12-05 08:28:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-05 08:28:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 08:28:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:28:08,798 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 08:28:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 08:28:09,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-05 08:28:09,411 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-05 08:28:09,412 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-12-05 08:28:09,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-12-05 08:28:09,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-12-05 08:28:09,419 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-05 08:28:09,419 WARN L246 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-05 08:28:09,419 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2024-12-05 08:28:09,540 INFO L143 ThreadInstanceAdder]: Constructed 42 joinOtherThreadTransitions. [2024-12-05 08:28:09,546 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:28:09,628 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-05 08:28:09,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-05 08:28:09,628 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;@6a25395e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-05 08:28:09,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations.