./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_82-list_racefree.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 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/goblint-regression/28-race_reach_82-list_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 01:12:18,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 01:12:18,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 01:12:18,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 01:12:18,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 01:12:18,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 01:12:18,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 01:12:18,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 01:12:18,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 01:12:18,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 01:12:18,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 01:12:18,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 01:12:18,964 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 01:12:18,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 01:12:18,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 01:12:18,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 01:12:18,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 01:12:18,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 01:12:18,967 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 01:12:18,968 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 01:12:18,968 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 -> 6ac894f5c6207d1329786eb676509b79ca36f8c33f880cc59ffa30652ab92765 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 01:12:19,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 01:12:19,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 01:12:19,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 01:12:19,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 01:12:19,228 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 01:12:19,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_82-list_racefree.i [2025-01-24 01:12:20,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/23ecf2269/cbd8f3401272459eba7d4e130e49a58c/FLAGdf434c914 [2025-01-24 01:12:20,651 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 01:12:20,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_82-list_racefree.i [2025-01-24 01:12:20,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/23ecf2269/cbd8f3401272459eba7d4e130e49a58c/FLAGdf434c914 [2025-01-24 01:12:20,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/23ecf2269/cbd8f3401272459eba7d4e130e49a58c [2025-01-24 01:12:20,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 01:12:20,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 01:12:20,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 01:12:20,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 01:12:20,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 01:12:20,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:12:20" (1/1) ... [2025-01-24 01:12:20,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5af356da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:20, skipping insertion in model container [2025-01-24 01:12:20,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:12:20" (1/1) ... [2025-01-24 01:12:20,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 01:12:20,955 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/goblint-regression/28-race_reach_82-list_racefree.i[47038,47051] [2025-01-24 01:12:20,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 01:12:20,989 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 01:12:21,042 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/goblint-regression/28-race_reach_82-list_racefree.i[47038,47051] [2025-01-24 01:12:21,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 01:12:21,087 INFO L204 MainTranslator]: Completed translation [2025-01-24 01:12:21,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21 WrapperNode [2025-01-24 01:12:21,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 01:12:21,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 01:12:21,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 01:12:21,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 01:12:21,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,116 INFO L138 Inliner]: procedures = 279, calls = 67, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2025-01-24 01:12:21,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 01:12:21,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 01:12:21,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 01:12:21,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 01:12:21,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 01:12:21,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 01:12:21,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 01:12:21,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 01:12:21,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (1/1) ... [2025-01-24 01:12:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 01:12:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 01:12:21,187 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) [2025-01-24 01:12:21,194 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 [2025-01-24 01:12:21,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-24 01:12:21,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-24 01:12:21,209 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-01-24 01:12:21,210 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-24 01:12:21,210 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 01:12:21,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-24 01:12:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 01:12:21,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 01:12:21,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 01:12:21,212 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 01:12:21,309 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 01:12:21,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 01:12:21,551 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 01:12:21,552 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 01:12:21,718 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 01:12:21,718 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-24 01:12:21,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:12:21 BoogieIcfgContainer [2025-01-24 01:12:21,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 01:12:21,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 01:12:21,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 01:12:21,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 01:12:21,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:12:20" (1/3) ... [2025-01-24 01:12:21,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61062241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:12:21, skipping insertion in model container [2025-01-24 01:12:21,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:12:21" (2/3) ... [2025-01-24 01:12:21,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61062241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:12:21, skipping insertion in model container [2025-01-24 01:12:21,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:12:21" (3/3) ... [2025-01-24 01:12:21,725 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_82-list_racefree.i [2025-01-24 01:12:21,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 01:12:21,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_82-list_racefree.i that has 3 procedures, 56 locations, 1 initial locations, 10 loop locations, and 1 error locations. [2025-01-24 01:12:21,735 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 01:12:21,786 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-24 01:12:21,820 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 01:12:21,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 01:12:21,824 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) [2025-01-24 01:12:21,829 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 [2025-01-24 01:12:21,904 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 01:12:21,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2025-01-24 01:12:21,936 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;@172125a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:21,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 01:12:23,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 01:12:23,299 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:12:23,299 INFO L139 ounterexampleChecker]: Examining path program with hash -1442961971, occurence #1 [2025-01-24 01:12:23,300 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:12:23,300 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:12:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:12:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1116218273, now seen corresponding path program 1 times [2025-01-24 01:12:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:12:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686853291] [2025-01-24 01:12:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:12:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:12:23,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-24 01:12:23,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-24 01:12:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:23,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 01:12:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 01:12:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 01:12:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686853291] [2025-01-24 01:12:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686853291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 01:12:23,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 01:12:23,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 01:12:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296666624] [2025-01-24 01:12:23,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 01:12:23,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 01:12:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 01:12:23,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 01:12:23,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 01:12:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:23,612 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 01:12:23,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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) [2025-01-24 01:12:23,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 01:12:24,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 01:12:24,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 01:12:24,817 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-24 01:12:24,818 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE (1/2) [2025-01-24 01:12:24,820 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:24,821 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 01:12:24,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 01:12:24,821 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;@172125a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:24,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 01:12:24,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 01:12:24,825 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:12:24,825 INFO L139 ounterexampleChecker]: Examining path program with hash 1700309748, occurence #1 [2025-01-24 01:12:24,825 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:12:24,825 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:12:24,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:12:24,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1518122201, now seen corresponding path program 1 times [2025-01-24 01:12:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:12:24,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857000609] [2025-01-24 01:12:24,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:12:24,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:12:24,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-24 01:12:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-24 01:12:24,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:24,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 01:12:24,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 01:12:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-24 01:12:24,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-24 01:12:24,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:24,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 01:12:24,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 01:12:24,956 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 01:12:24,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 01:12:24,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-24 01:12:24,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-24 01:12:24,958 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-24 01:12:24,958 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2025-01-24 01:12:24,958 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 01:12:24,958 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-24 01:12:24,992 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-24 01:12:24,995 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:25,011 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 01:12:25,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of2ForFork1 ======== [2025-01-24 01:12:25,012 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;@172125a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:25,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 01:12:33,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 01:12:33,642 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:12:33,642 INFO L139 ounterexampleChecker]: Examining path program with hash -741233931, occurence #1 [2025-01-24 01:12:33,642 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:12:33,642 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:12:33,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:12:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1832033290, now seen corresponding path program 1 times [2025-01-24 01:12:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:12:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104453833] [2025-01-24 01:12:33,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:12:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:12:33,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-24 01:12:33,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-24 01:12:33,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:33,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 01:12:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 01:12:33,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 01:12:33,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104453833] [2025-01-24 01:12:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104453833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 01:12:33,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 01:12:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 01:12:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464134322] [2025-01-24 01:12:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 01:12:33,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 01:12:33,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 01:12:33,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 01:12:33,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 01:12:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:33,733 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 01:12:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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) [2025-01-24 01:12:33,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:46,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-24 01:12:46,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 01:12:46,253 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:12:46,253 INFO L139 ounterexampleChecker]: Examining path program with hash 924508585, occurence #1 [2025-01-24 01:12:46,253 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:12:46,253 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:12:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:12:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 39413595, now seen corresponding path program 1 times [2025-01-24 01:12:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:12:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097294464] [2025-01-24 01:12:46,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:12:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:12:46,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-24 01:12:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-24 01:12:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 01:12:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 01:12:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 01:12:46,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097294464] [2025-01-24 01:12:46,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097294464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 01:12:46,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 01:12:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 01:12:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528131739] [2025-01-24 01:12:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 01:12:46,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 01:12:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 01:12:46,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 01:12:46,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-24 01:12:46,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:46,417 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 01:12:46,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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) [2025-01-24 01:12:46,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:46,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:12:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-24 01:12:52,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 01:12:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-24 01:12:52,881 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-24 01:12:52,881 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread1of2ForFork1 was SAFE (1/3) [2025-01-24 01:12:52,886 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:52,887 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 01:12:52,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 01:12:52,889 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;@172125a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:52,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 01:12:52,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 01:12:52,896 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:12:52,896 INFO L139 ounterexampleChecker]: Examining path program with hash 2018610002, occurence #1 [2025-01-24 01:12:52,896 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:12:52,896 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:12:52,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:12:52,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2137709534, now seen corresponding path program 1 times [2025-01-24 01:12:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:12:52,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895600880] [2025-01-24 01:12:52,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:12:52,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:12:52,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 01:12:52,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 01:12:52,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:52,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 01:12:52,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 01:12:52,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 01:12:52,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 01:12:52,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:12:52,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 01:12:53,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 01:12:53,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 01:12:53,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 01:12:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-24 01:12:53,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-24 01:12:53,011 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-24 01:12:53,011 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2025-01-24 01:12:53,011 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 01:12:53,011 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-24 01:12:53,058 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-24 01:12:53,062 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:53,085 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 01:12:53,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread3of3ForFork1 ======== [2025-01-24 01:12:53,085 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;@172125a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:12:53,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 01:13:11,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 01:13:11,294 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:13:11,294 INFO L139 ounterexampleChecker]: Examining path program with hash -369881132, occurence #1 [2025-01-24 01:13:11,294 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:13:11,294 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:13:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:13:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash 636366157, now seen corresponding path program 1 times [2025-01-24 01:13:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:13:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162918760] [2025-01-24 01:13:11,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:13:11,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:13:11,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-24 01:13:11,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-24 01:13:11,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:13:11,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 01:13:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 01:13:11,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 01:13:11,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162918760] [2025-01-24 01:13:11,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162918760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 01:13:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 01:13:11,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 01:13:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870271334] [2025-01-24 01:13:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 01:13:11,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 01:13:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 01:13:11,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 01:13:11,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 01:13:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:11,393 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 01:13:11,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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) [2025-01-24 01:13:11,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-24 01:13:13,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 01:13:13,815 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:13:13,815 INFO L139 ounterexampleChecker]: Examining path program with hash 665132422, occurence #1 [2025-01-24 01:13:13,815 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:13:13,815 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:13:13,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:13:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash 474600733, now seen corresponding path program 1 times [2025-01-24 01:13:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:13:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878088756] [2025-01-24 01:13:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:13:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:13:13,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-24 01:13:13,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-24 01:13:13,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:13:13,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 01:13:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 01:13:13,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 01:13:13,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878088756] [2025-01-24 01:13:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878088756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 01:13:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 01:13:13,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-24 01:13:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383405441] [2025-01-24 01:13:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 01:13:13,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-24 01:13:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 01:13:13,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-24 01:13:13,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-24 01:13:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:13,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 01:13:13,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 01:13:13,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:13,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-24 01:13:27,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-24 01:13:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-24 01:13:27,658 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-24 01:13:27,658 INFO L319 ceAbstractionStarter]: Result for error location t2_funThread3of3ForFork1 was SAFE (1/4) [2025-01-24 01:13:27,662 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:13:27,663 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 01:13:27,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of3ForFork1 ======== [2025-01-24 01:13:27,663 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;@172125a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 01:13:27,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-24 01:13:31,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-24 01:13:31,587 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 01:13:31,587 INFO L139 ounterexampleChecker]: Examining path program with hash 281073814, occurence #1 [2025-01-24 01:13:31,587 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 01:13:31,587 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 01:13:31,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 01:13:31,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1684314918, now seen corresponding path program 1 times [2025-01-24 01:13:31,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 01:13:31,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132247934] [2025-01-24 01:13:31,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 01:13:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 01:13:31,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-24 01:13:31,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-24 01:13:31,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 01:13:31,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 01:13:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 01:13:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 01:13:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132247934] [2025-01-24 01:13:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132247934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 01:13:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 01:13:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 01:13:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701642627] [2025-01-24 01:13:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 01:13:31,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 01:13:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 01:13:31,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 01:13:31,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 01:13:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 01:13:31,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 01:13:31,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-24 01:13:31,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.