./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i --full-output --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cc2344d8bedffb786f66d288e651407abc416f1e22d065ca4595f05e214f2a3 --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 10:40:23,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 10:40:23,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 10:40:23,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 10:40:23,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 10:40:23,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 10:40:23,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 10:40:23,604 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 10:40:23,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 10:40:23,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 10:40:23,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 10:40:23,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 10:40:23,606 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 10:40:23,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 10:40:23,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 10:40:23,606 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 10:40:23,606 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 10:40:23,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 10:40:23,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 10:40:23,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 10:40:23,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 10:40:23,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 10:40:23,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 10:40:23,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 10:40:23,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 10:40:23,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 10:40:23,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 10:40:23,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 10:40:23,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 10:40:23,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 10:40:23,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 10:40:23,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 10:40:23,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 10:40:23,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 10:40:23,609 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 10:40:23,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cc2344d8bedffb786f66d288e651407abc416f1e22d065ca4595f05e214f2a3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2024-12-17 10:40:23,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 10:40:23,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 10:40:23,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 10:40:23,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 10:40:23,901 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 10:40:23,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2024-12-17 10:40:25,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/13e32ca9f/875c79bb82694097bd176677b33985cc/FLAG444a2e005 [2024-12-17 10:40:25,513 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 10:40:25,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2024-12-17 10:40:25,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/13e32ca9f/875c79bb82694097bd176677b33985cc/FLAG444a2e005 [2024-12-17 10:40:25,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/13e32ca9f/875c79bb82694097bd176677b33985cc [2024-12-17 10:40:25,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 10:40:25,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 10:40:25,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 10:40:25,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 10:40:25,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 10:40:25,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:25,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df679f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25, skipping insertion in model container [2024-12-17 10:40:25,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:25,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 10:40:25,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30297,30310] [2024-12-17 10:40:25,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30487,30500] [2024-12-17 10:40:25,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31293,31306] [2024-12-17 10:40:25,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31584,31597] [2024-12-17 10:40:25,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31812,31825] [2024-12-17 10:40:25,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32286,32299] [2024-12-17 10:40:25,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32509,32522] [2024-12-17 10:40:25,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32707,32720] [2024-12-17 10:40:25,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32902,32915] [2024-12-17 10:40:25,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33095,33108] [2024-12-17 10:40:25,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33516,33529] [2024-12-17 10:40:25,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 10:40:25,885 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 10:40:25,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30297,30310] [2024-12-17 10:40:25,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[30487,30500] [2024-12-17 10:40:25,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31293,31306] [2024-12-17 10:40:25,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31584,31597] [2024-12-17 10:40:25,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[31812,31825] [2024-12-17 10:40:25,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32286,32299] [2024-12-17 10:40:25,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32509,32522] [2024-12-17 10:40:25,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32707,32720] [2024-12-17 10:40:25,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[32902,32915] [2024-12-17 10:40:25,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33095,33108] [2024-12-17 10:40:25,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i[33516,33529] [2024-12-17 10:40:25,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 10:40:25,958 INFO L204 MainTranslator]: Completed translation [2024-12-17 10:40:25,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25 WrapperNode [2024-12-17 10:40:25,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 10:40:25,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 10:40:25,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 10:40:25,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 10:40:25,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:25,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,021 INFO L138 Inliner]: procedures = 180, calls = 48, calls flagged for inlining = 43, calls inlined = 68, statements flattened = 450 [2024-12-17 10:40:26,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 10:40:26,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 10:40:26,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 10:40:26,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 10:40:26,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,059 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 10:40:26,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 10:40:26,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 10:40:26,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 10:40:26,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (1/1) ... [2024-12-17 10:40:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 10:40:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 10:40:26,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 10:40:26,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 10:40:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-12-17 10:40:26,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-12-17 10:40:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 10:40:26,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 10:40:26,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 10:40:26,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 10:40:26,156 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 10:40:26,267 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 10:40:26,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 10:40:26,789 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 10:40:26,789 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 10:40:27,031 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 10:40:27,033 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-17 10:40:27,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:40:27 BoogieIcfgContainer [2024-12-17 10:40:27,033 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 10:40:27,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 10:40:27,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 10:40:27,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 10:40:27,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:40:25" (1/3) ... [2024-12-17 10:40:27,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edbafae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:40:27, skipping insertion in model container [2024-12-17 10:40:27,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:40:25" (2/3) ... [2024-12-17 10:40:27,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edbafae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:40:27, skipping insertion in model container [2024-12-17 10:40:27,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:40:27" (3/3) ... [2024-12-17 10:40:27,041 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_NetBSD_sysmon_power_sliced.i [2024-12-17 10:40:27,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 10:40:27,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_NetBSD_sysmon_power_sliced.i that has 2 procedures, 124 locations, 1 initial locations, 3 loop locations, and 11 error locations. [2024-12-17 10:40:27,054 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 10:40:27,125 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:40:27,176 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:27,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 10:40:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 10:40:27,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 10:40:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 10:40:27,242 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:40:27,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-12-17 10:40:27,259 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;@4704af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:27,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-12-17 10:40:27,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:40:27,430 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:40:27,431 INFO L139 ounterexampleChecker]: Examining path program with hash 1051529882, occurence #1 [2024-12-17 10:40:27,432 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:40:27,432 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:40:27,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:40:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -685730022, now seen corresponding path program 1 times [2024-12-17 10:40:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:40:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668008074] [2024-12-17 10:40:27,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:40:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:40:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:40:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:40:27,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:40:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668008074] [2024-12-17 10:40:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668008074] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:40:27,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:40:27,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:40:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560665598] [2024-12-17 10:40:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:40:27,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:40:27,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:40:27,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:40:27,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:40:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:27,751 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:40:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:40:27,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:40:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 10:40:27,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:40:27,978 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:40:27,978 INFO L139 ounterexampleChecker]: Examining path program with hash -1520853290, occurence #1 [2024-12-17 10:40:27,978 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:40:27,979 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:40:27,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:40:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1324454113, now seen corresponding path program 1 times [2024-12-17 10:40:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:40:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535656097] [2024-12-17 10:40:27,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:40:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:40:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:40:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:40:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:40:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535656097] [2024-12-17 10:40:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535656097] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:40:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:40:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:40:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802327699] [2024-12-17 10:40:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:40:28,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:40:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:40:28,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:40:28,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:40:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:28,106 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:40:28,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:40:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:40:28,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:40:29,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:40:29,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2024-12-17 10:40:29,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2024-12-17 10:40:29,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2024-12-17 10:40:29,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-12-17 10:40:29,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2024-12-17 10:40:29,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-17 10:40:29,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:40:29,654 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-12-17 10:40:29,658 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:29,659 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:40:29,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:40:29,660 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;@4704af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:29,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:40:29,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:40:29,664 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:40:29,664 INFO L139 ounterexampleChecker]: Examining path program with hash -323337156, occurence #1 [2024-12-17 10:40:29,664 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:40:29,667 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:40:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:40:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1295220781, now seen corresponding path program 1 times [2024-12-17 10:40:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:40:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205156963] [2024-12-17 10:40:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:40:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:40:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:40:29,679 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:40:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:40:29,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:40:29,703 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:40:29,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-12-17 10:40:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-17 10:40:29,706 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-17 10:40:29,707 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-12-17 10:40:29,708 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:40:29,709 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-12-17 10:40:29,765 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:40:29,770 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:29,783 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:40:29,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:40:29,784 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;@4704af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:29,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:40:29,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:40:29,922 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:40:29,922 INFO L139 ounterexampleChecker]: Examining path program with hash -985060140, occurence #1 [2024-12-17 10:40:29,922 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:40:29,922 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:40:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:40:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1328415346, now seen corresponding path program 1 times [2024-12-17 10:40:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:40:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490580428] [2024-12-17 10:40:29,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:40:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:40:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:40:29,932 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:40:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:40:29,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:40:29,943 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:40:29,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-12-17 10:40:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-17 10:40:29,945 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-17 10:40:29,945 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-12-17 10:40:29,945 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:40:29,945 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-12-17 10:40:30,039 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:40:30,045 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:30,060 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:40:30,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-12-17 10:40:30,061 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;@4704af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:40:30,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-12-17 10:40:30,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:40:30,389 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:40:30,389 INFO L139 ounterexampleChecker]: Examining path program with hash -778204980, occurence #1 [2024-12-17 10:40:30,389 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:40:30,389 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:40:30,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:40:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -780806215, now seen corresponding path program 1 times [2024-12-17 10:40:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:40:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416418155] [2024-12-17 10:40:30,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:40:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:40:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:40:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:40:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:40:30,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416418155] [2024-12-17 10:40:30,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416418155] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:40:30,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:40:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:40:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432887642] [2024-12-17 10:40:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:40:30,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:40:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:40:30,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:40:30,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:40:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:30,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:40:30,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:40:30,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:40:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-17 10:40:36,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:40:36,506 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:40:36,507 INFO L139 ounterexampleChecker]: Examining path program with hash -1733913665, occurence #1 [2024-12-17 10:40:36,507 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:40:36,507 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:40:36,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:40:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash -475939491, now seen corresponding path program 1 times [2024-12-17 10:40:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:40:36,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398370010] [2024-12-17 10:40:36,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:40:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:40:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:40:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:40:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:40:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398370010] [2024-12-17 10:40:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398370010] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:40:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:40:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:40:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826028707] [2024-12-17 10:40:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:40:36,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:40:36,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:40:36,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:40:36,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:40:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:40:36,683 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:40:36,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:40:36,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:40:36,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:46:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2024-12-17 10:46:36,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2024-12-17 10:46:36,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-17 10:46:36,706 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-12-17 10:46:36,707 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2024-12-17 10:46:36,711 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:46:36,712 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:46:36,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 10:46:36,712 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;@4704af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:46:36,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-17 10:46:36,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-12-17 10:46:36,721 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:46:36,725 INFO L139 ounterexampleChecker]: Examining path program with hash 1958880688, occurence #1 [2024-12-17 10:46:36,725 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:46:36,725 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:46:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:46:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1395651136, now seen corresponding path program 1 times [2024-12-17 10:46:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:46:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883550400] [2024-12-17 10:46:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:46:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:46:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:46:36,738 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-17 10:46:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-17 10:46:36,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-17 10:46:36,747 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-17 10:46:36,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-12-17 10:46:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-17 10:46:36,750 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-12-17 10:46:36,750 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-12-17 10:46:36,750 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-12-17 10:46:36,750 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-12-17 10:46:36,806 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-12-17 10:46:36,814 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:46:36,832 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 10:46:36,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-12-17 10:46:36,833 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;@4704af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 10:46:36,833 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-12-17 10:46:37,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:46:37,064 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:46:37,064 INFO L139 ounterexampleChecker]: Examining path program with hash 645004223, occurence #1 [2024-12-17 10:46:37,064 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:46:37,065 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:46:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:46:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 31344993, now seen corresponding path program 1 times [2024-12-17 10:46:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:46:37,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096398369] [2024-12-17 10:46:37,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:46:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:46:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:46:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:46:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:46:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096398369] [2024-12-17 10:46:37,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096398369] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:46:37,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:46:37,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 10:46:37,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820398223] [2024-12-17 10:46:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:46:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-12-17 10:46:37,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:46:37,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-12-17 10:46:37,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-12-17 10:46:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:37,111 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:46:37,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:46:37,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:37,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-17 10:46:37,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:46:37,158 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:46:37,158 INFO L139 ounterexampleChecker]: Examining path program with hash -434736550, occurence #1 [2024-12-17 10:46:37,158 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:46:37,158 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:46:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:46:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1827217515, now seen corresponding path program 1 times [2024-12-17 10:46:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:46:37,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538566382] [2024-12-17 10:46:37,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:46:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:46:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:46:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:46:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:46:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538566382] [2024-12-17 10:46:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538566382] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:46:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:46:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:46:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757364649] [2024-12-17 10:46:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:46:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:46:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:46:37,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:46:37,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:46:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:37,333 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:46:37,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:46:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:46:38,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-17 10:46:38,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err3ASSERT_VIOLATIONERROR_FUNCTION, thr1Err5ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2024-12-17 10:46:38,087 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 10:46:38,087 INFO L139 ounterexampleChecker]: Examining path program with hash -119950593, occurence #1 [2024-12-17 10:46:38,087 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 10:46:38,087 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 10:46:38,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 10:46:38,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1998495999, now seen corresponding path program 1 times [2024-12-17 10:46:38,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 10:46:38,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919228955] [2024-12-17 10:46:38,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 10:46:38,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 10:46:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 10:46:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 10:46:38,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 10:46:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919228955] [2024-12-17 10:46:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919228955] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 10:46:38,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 10:46:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-17 10:46:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514240308] [2024-12-17 10:46:38,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 10:46:38,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 10:46:38,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 10:46:38,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 10:46:38,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 10:46:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:38,138 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 10:46:38,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 10:46:38,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 10:46:38,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 10:46:38,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.