./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-theta/unwind3-100.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 18:04:44,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 18:04:44,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 18:04:44,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 18:04:44,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 18:04:44,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 18:04:44,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 18:04:44,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 18:04:44,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 18:04:44,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 18:04:44,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 18:04:44,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 18:04:44,455 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 18:04:44,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 18:04:44,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 18:04:44,456 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 18:04:44,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 18:04:44,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 18:04:44,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 18:04:44,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 18:04:44,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:04:44,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:04:44,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:04:44,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 18:04:44,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:04:44,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:04:44,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:04:44,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:04:44,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 18:04:44,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 18:04:44,477 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 18:04:44,477 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/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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-04-24 18:04:44,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 18:04:44,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 18:04:44,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 18:04:44,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 18:04:44,754 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 18:04:44,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-04-24 18:04:46,176 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c9b548c21/79d0d87e4f604427bad771a3b2089f3a/FLAG7cde2aef6 [2025-04-24 18:04:46,438 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 18:04:46,441 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-04-24 18:04:46,455 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c9b548c21/79d0d87e4f604427bad771a3b2089f3a/FLAG7cde2aef6 [2025-04-24 18:04:47,177 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c9b548c21/79d0d87e4f604427bad771a3b2089f3a [2025-04-24 18:04:47,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 18:04:47,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 18:04:47,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 18:04:47,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 18:04:47,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 18:04:47,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f7a12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47, skipping insertion in model container [2025-04-24 18:04:47,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 18:04:47,494 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i[33026,33039] [2025-04-24 18:04:47,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:04:47,519 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 18:04:47,589 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i[33026,33039] [2025-04-24 18:04:47,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:04:47,622 INFO L204 MainTranslator]: Completed translation [2025-04-24 18:04:47,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47 WrapperNode [2025-04-24 18:04:47,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 18:04:47,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 18:04:47,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 18:04:47,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 18:04:47,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,660 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-24 18:04:47,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 18:04:47,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 18:04:47,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 18:04:47,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 18:04:47,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 18:04:47,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 18:04:47,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 18:04:47,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 18:04:47,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (1/1) ... [2025-04-24 18:04:47,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:04:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:04:47,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 18:04:47,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 18:04:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 18:04:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-24 18:04:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-24 18:04:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-24 18:04:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-24 18:04:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 18:04:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 18:04:47,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 18:04:47,726 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 18:04:47,814 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 18:04:47,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 18:04:47,917 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 18:04:47,917 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 18:04:47,977 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 18:04:47,977 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 18:04:47,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:04:47 BoogieIcfgContainer [2025-04-24 18:04:47,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 18:04:47,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 18:04:47,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 18:04:47,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 18:04:47,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 06:04:47" (1/3) ... [2025-04-24 18:04:47,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddb2022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:04:47, skipping insertion in model container [2025-04-24 18:04:47,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:04:47" (2/3) ... [2025-04-24 18:04:47,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddb2022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:04:47, skipping insertion in model container [2025-04-24 18:04:47,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:04:47" (3/3) ... [2025-04-24 18:04:47,985 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-04-24 18:04:47,997 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 18:04:47,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 20 locations, 20 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-24 18:04:47,999 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 18:04:48,034 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:04:48,064 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:48,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 18:04:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:04:48,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 18:04:48,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 18:04:48,143 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:48,160 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2025-04-24 18:04:48,169 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:48,170 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:48,196 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:48,197 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:48,197 INFO L139 ounterexampleChecker]: Examining path program with hash -1850587884, occurence #1 [2025-04-24 18:04:48,197 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:48,197 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:48,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1485759046, now seen corresponding path program 1 times [2025-04-24 18:04:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:48,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144224697] [2025-04-24 18:04:48,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:48,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-24 18:04:48,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-24 18:04:48,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:48,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:48,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-04-24 18:04:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:48,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144224697] [2025-04-24 18:04:48,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144224697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:48,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:48,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:04:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046540685] [2025-04-24 18:04:48,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:48,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 18:04:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:48,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 18:04:48,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 18:04:48,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:48,430 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:48,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-04-24 18:04:48,431 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:48,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:48,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 18:04:48,492 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:48,492 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:48,492 INFO L139 ounterexampleChecker]: Examining path program with hash 1737353845, occurence #1 [2025-04-24 18:04:48,492 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:48,492 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:48,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash -236137002, now seen corresponding path program 1 times [2025-04-24 18:04:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:48,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385944599] [2025-04-24 18:04:48,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:48,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:48,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-24 18:04:48,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-24 18:04:48,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:48,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:04:48,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:48,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385944599] [2025-04-24 18:04:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385944599] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:04:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48838197] [2025-04-24 18:04:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:48,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:04:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:48,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:04:48,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:04:48,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:48,680 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:48,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-04-24 18:04:48,680 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:48,680 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:48,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:48,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:48,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 18:04:48,729 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:48,729 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:48,729 INFO L139 ounterexampleChecker]: Examining path program with hash 1737353845, occurence #2 [2025-04-24 18:04:48,729 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:04:48,729 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:04:48,730 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:04:48,730 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:04:48,730 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:04:48,730 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 18:04:48,730 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:04:48,731 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:04:48,731 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:48,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1269656892, now seen corresponding path program 1 times [2025-04-24 18:04:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:48,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663528093] [2025-04-24 18:04:48,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:48,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:48,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:04:48,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:04:48,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:04:48,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:48,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663528093] [2025-04-24 18:04:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663528093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:04:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505854036] [2025-04-24 18:04:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:48,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:04:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:48,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:04:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:04:48,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:48,838 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:48,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-04-24 18:04:48,839 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:48,839 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:48,839 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:48,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:48,882 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:48,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 18:04:48,887 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-24 18:04:48,891 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was SAFE (1/2) [2025-04-24 18:04:48,893 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:48,894 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:48,894 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:04:48,894 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:48,894 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:04:48,898 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:04:48,898 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:48,898 INFO L139 ounterexampleChecker]: Examining path program with hash -990531628, occurence #1 [2025-04-24 18:04:48,898 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:48,898 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:48,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash 324812989, now seen corresponding path program 1 times [2025-04-24 18:04:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:48,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92938763] [2025-04-24 18:04:48,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:48,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-24 18:04:48,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-24 18:04:48,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:48,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:48,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:04:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-24 18:04:48,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-24 18:04:48,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:48,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:48,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:04:48,924 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:04:48,924 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:04:48,924 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:04:48,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 18:04:48,926 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 18:04:48,927 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2025-04-24 18:04:48,927 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 18:04:48,927 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-24 18:04:48,944 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:04:48,947 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:48,956 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:48,957 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:04:48,957 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:48,958 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:04:49,006 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:04:49,007 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:49,007 INFO L139 ounterexampleChecker]: Examining path program with hash -220974882, occurence #1 [2025-04-24 18:04:49,007 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:49,007 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:49,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:49,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1551248072, now seen corresponding path program 1 times [2025-04-24 18:04:49,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:49,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340197758] [2025-04-24 18:04:49,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:49,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:49,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:04:49,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:04:49,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:49,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:49,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:04:49,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:04:49,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:04:49,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:49,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:49,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:04:49,032 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:04:49,032 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:04:49,032 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:04:49,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 18:04:49,033 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 18:04:49,033 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/3) [2025-04-24 18:04:49,033 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 18:04:49,033 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-24 18:04:49,056 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:04:49,057 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,067 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:49,068 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of3ForFork0 ======== [2025-04-24 18:04:49,068 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,068 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:49,339 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:49,340 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:49,341 INFO L320 ceAbstractionStarter]: Result for error location f2Thread3of3ForFork0 was SAFE (1/4) [2025-04-24 18:04:49,343 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,345 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:49,345 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:04:49,346 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,346 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:04:49,351 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:04:49,351 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:49,351 INFO L139 ounterexampleChecker]: Examining path program with hash 1133837895, occurence #1 [2025-04-24 18:04:49,352 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:49,352 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:49,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:49,352 INFO L85 PathProgramCache]: Analyzing trace with hash -570622774, now seen corresponding path program 1 times [2025-04-24 18:04:49,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:49,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492134669] [2025-04-24 18:04:49,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:49,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:49,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 18:04:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 18:04:49,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:49,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:49,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:04:49,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 18:04:49,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 18:04:49,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:49,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:49,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:04:49,389 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:04:49,390 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:04:49,390 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:04:49,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 18:04:49,391 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 18:04:49,391 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/4) [2025-04-24 18:04:49,391 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 18:04:49,391 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-24 18:04:49,418 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:04:49,421 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,439 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:49,440 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of4ForFork0 ======== [2025-04-24 18:04:49,441 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,442 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:49,922 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:49,923 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:49,923 INFO L320 ceAbstractionStarter]: Result for error location f2Thread3of4ForFork0 was SAFE (1/5) [2025-04-24 18:04:49,927 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,928 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:49,928 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of4ForFork0 ======== [2025-04-24 18:04:49,928 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:49,928 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:50,172 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:50,173 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:50,174 INFO L320 ceAbstractionStarter]: Result for error location f2Thread4of4ForFork0 was SAFE (2/5) [2025-04-24 18:04:50,176 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:50,177 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:50,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of4ForFork0 ======== [2025-04-24 18:04:50,177 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:50,177 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:50,392 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:50,395 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:50,396 INFO L320 ceAbstractionStarter]: Result for error location f2Thread2of4ForFork0 was SAFE (3/5) [2025-04-24 18:04:50,398 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:50,399 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:50,400 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of4ForFork0 ======== [2025-04-24 18:04:50,400 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:50,401 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:50,404 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:50,404 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:50,404 INFO L139 ounterexampleChecker]: Examining path program with hash -1663312185, occurence #1 [2025-04-24 18:04:50,405 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:50,405 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:50,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:50,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1066444325, now seen corresponding path program 1 times [2025-04-24 18:04:50,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:50,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069129347] [2025-04-24 18:04:50,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:50,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:50,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-24 18:04:50,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-24 18:04:50,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:50,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:04:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:50,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069129347] [2025-04-24 18:04:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069129347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:04:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467301782] [2025-04-24 18:04:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:50,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 18:04:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:50,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 18:04:50,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 18:04:50,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,447 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:50,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-04-24 18:04:50,447 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 18:04:50,477 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:50,477 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:50,477 INFO L139 ounterexampleChecker]: Examining path program with hash -1127918317, occurence #1 [2025-04-24 18:04:50,477 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:50,477 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:50,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1653421229, now seen corresponding path program 1 times [2025-04-24 18:04:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:50,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368962331] [2025-04-24 18:04:50,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:50,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:50,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-24 18:04:50,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-24 18:04:50,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:50,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:04:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:50,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368962331] [2025-04-24 18:04:50,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368962331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:50,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:50,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:04:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699334168] [2025-04-24 18:04:50,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:50,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:04:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:50,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:04:50,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:04:50,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,569 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:50,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-04-24 18:04:50,569 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,569 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 18:04:50,602 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:50,602 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:50,602 INFO L139 ounterexampleChecker]: Examining path program with hash -1127918317, occurence #2 [2025-04-24 18:04:50,602 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:04:50,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:04:50,603 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:04:50,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:04:50,603 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:04:50,603 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 18:04:50,603 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:04:50,603 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:04:50,603 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:50,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 283519168, now seen corresponding path program 1 times [2025-04-24 18:04:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:50,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336138583] [2025-04-24 18:04:50,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:50,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:04:50,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:04:50,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:50,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:04:50,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:50,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336138583] [2025-04-24 18:04:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336138583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:04:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90750704] [2025-04-24 18:04:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:50,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:04:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:50,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:04:50,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:04:50,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,658 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:50,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-04-24 18:04:50,658 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,658 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,658 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 18:04:50,711 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:50,711 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:50,711 INFO L139 ounterexampleChecker]: Examining path program with hash 609264983, occurence #1 [2025-04-24 18:04:50,711 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:50,711 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:50,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:50,712 INFO L85 PathProgramCache]: Analyzing trace with hash -771685754, now seen corresponding path program 1 times [2025-04-24 18:04:50,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:50,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263264580] [2025-04-24 18:04:50,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:50,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 18:04:50,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 18:04:50,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:50,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:04:50,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:50,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263264580] [2025-04-24 18:04:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263264580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:50,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:50,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 18:04:50,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483889297] [2025-04-24 18:04:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:50,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 18:04:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:50,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 18:04:50,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 18:04:50,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,784 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:50,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-04-24 18:04:50,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,784 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:04:50,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-24 18:04:50,860 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:50,861 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:50,861 INFO L139 ounterexampleChecker]: Examining path program with hash 726308487, occurence #1 [2025-04-24 18:04:50,861 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:50,861 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:50,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1962323446, now seen corresponding path program 1 times [2025-04-24 18:04:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:50,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864386239] [2025-04-24 18:04:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:50,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 18:04:50,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:04:50,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:50,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:04:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:50,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864386239] [2025-04-24 18:04:50,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864386239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:50,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:50,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-24 18:04:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978710604] [2025-04-24 18:04:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:50,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 18:04:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:50,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 18:04:50,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-24 18:04:50,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:50,964 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:50,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-04-24 18:04:50,965 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:50,965 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,965 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:50,965 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:04:50,965 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:51,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:51,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:51,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:51,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:04:51,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:04:51,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-24 18:04:51,056 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:04:51,056 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:51,056 INFO L139 ounterexampleChecker]: Examining path program with hash -1306907413, occurence #1 [2025-04-24 18:04:51,056 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:51,056 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:51,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1379094732, now seen corresponding path program 1 times [2025-04-24 18:04:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:51,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175602624] [2025-04-24 18:04:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:51,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:51,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 18:04:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 18:04:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:51,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:04:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:04:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:04:51,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175602624] [2025-04-24 18:04:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175602624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:04:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:04:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 18:04:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337260033] [2025-04-24 18:04:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:04:51,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-24 18:04:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:04:51,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-24 18:04:51,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-24 18:04:51,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:51,165 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:04:51,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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-04-24 18:04:51,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:51,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:51,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:51,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:04:51,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:04:51,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:04:51,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:04:51,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:51,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:04:51,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:04:51,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:04:51,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 18:04:51,459 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:51,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-24 18:04:51,461 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-24 18:04:51,462 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of4ForFork0 was SAFE (4/5) [2025-04-24 18:04:51,463 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:51,464 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:51,465 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:04:51,465 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:51,465 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:04:51,470 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:04:51,470 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:51,471 INFO L139 ounterexampleChecker]: Examining path program with hash 138062333, occurence #1 [2025-04-24 18:04:51,471 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:51,471 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:51,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1821896785, now seen corresponding path program 1 times [2025-04-24 18:04:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:51,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685963275] [2025-04-24 18:04:51,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:51,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 18:04:51,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:04:51,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:51,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:51,485 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:04:51,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 18:04:51,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:04:51,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:51,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:51,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:04:51,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:04:51,503 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:04:51,504 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:04:51,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-24 18:04:51,505 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 18:04:51,505 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (5/5) [2025-04-24 18:04:51,505 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 18:04:51,505 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-24 18:04:51,536 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:04:51,539 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:51,556 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:51,556 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of5ForFork0 ======== [2025-04-24 18:04:51,557 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:51,557 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:52,767 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:52,768 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:52,768 INFO L320 ceAbstractionStarter]: Result for error location f2Thread2of5ForFork0 was SAFE (1/6) [2025-04-24 18:04:52,769 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:52,769 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:52,770 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of5ForFork0 ======== [2025-04-24 18:04:52,770 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:52,770 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:53,660 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:53,662 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:53,662 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of5ForFork0 was SAFE (2/6) [2025-04-24 18:04:53,664 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:53,665 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:53,665 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:04:53,667 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:53,667 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:04:53,674 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:04:53,674 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:04:53,674 INFO L139 ounterexampleChecker]: Examining path program with hash 408017213, occurence #1 [2025-04-24 18:04:53,675 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:04:53,675 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:04:53,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:04:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash -688143317, now seen corresponding path program 1 times [2025-04-24 18:04:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:04:53,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815246613] [2025-04-24 18:04:53,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:04:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:04:53,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 18:04:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 18:04:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:53,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:04:53,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 18:04:53,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 18:04:53,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:04:53,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:04:53,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:04:53,719 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:04:53,721 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:04:53,722 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:04:53,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-24 18:04:53,723 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 18:04:53,723 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (3/6) [2025-04-24 18:04:53,723 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 18:04:53,723 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-24 18:04:53,753 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:04:53,755 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:53,774 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:53,774 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of6ForFork0 ======== [2025-04-24 18:04:53,775 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:53,775 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:04:58,251 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:04:58,252 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:04:58,252 INFO L320 ceAbstractionStarter]: Result for error location f2Thread2of6ForFork0 was SAFE (1/7) [2025-04-24 18:04:58,254 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:58,254 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:04:58,254 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of6ForFork0 ======== [2025-04-24 18:04:58,254 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:04:58,254 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:05:02,294 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:05:02,295 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:05:02,295 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of6ForFork0 was SAFE (2/7) [2025-04-24 18:05:02,298 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:02,299 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:02,299 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of6ForFork0 ======== [2025-04-24 18:05:02,300 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:02,300 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:05:06,473 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:05:06,474 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:05:06,474 INFO L320 ceAbstractionStarter]: Result for error location f2Thread4of6ForFork0 was SAFE (3/7) [2025-04-24 18:05:06,476 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:06,476 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:06,476 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of6ForFork0 ======== [2025-04-24 18:05:06,477 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:06,477 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:05:06,480 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:06,480 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:06,480 INFO L139 ounterexampleChecker]: Examining path program with hash -28042435, occurence #1 [2025-04-24 18:05:06,480 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:06,480 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:06,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash -675539007, now seen corresponding path program 1 times [2025-04-24 18:05:06,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:06,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050958230] [2025-04-24 18:05:06,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-24 18:05:06,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-24 18:05:06,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:06,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:05:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:06,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050958230] [2025-04-24 18:05:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050958230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:05:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504803834] [2025-04-24 18:05:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:06,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 18:05:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:06,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 18:05:06,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 18:05:06,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,509 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:06,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-04-24 18:05:06,510 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-24 18:05:06,530 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:06,530 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:06,530 INFO L139 ounterexampleChecker]: Examining path program with hash 536910534, occurence #1 [2025-04-24 18:05:06,530 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:06,530 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:06,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1103387626, now seen corresponding path program 1 times [2025-04-24 18:05:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:06,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395689110] [2025-04-24 18:05:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:06,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-24 18:05:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-24 18:05:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:05:06,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:06,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395689110] [2025-04-24 18:05:06,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395689110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:06,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:05:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487959895] [2025-04-24 18:05:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:06,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:05:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:06,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:05:06,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:05:06,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,589 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:06,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-04-24 18:05:06,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-24 18:05:06,633 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:06,633 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:06,633 INFO L139 ounterexampleChecker]: Examining path program with hash 536910534, occurence #2 [2025-04-24 18:05:06,633 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:05:06,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:05:06,633 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:05:06,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:05:06,633 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:05:06,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 18:05:06,633 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:05:06,633 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:05:06,633 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:06,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash -154751604, now seen corresponding path program 1 times [2025-04-24 18:05:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:06,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496731126] [2025-04-24 18:05:06,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:06,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-24 18:05:06,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-24 18:05:06,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:06,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:05:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:06,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496731126] [2025-04-24 18:05:06,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496731126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:06,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:06,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 18:05:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458491251] [2025-04-24 18:05:06,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:06,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 18:05:06,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:06,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 18:05:06,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-24 18:05:06,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,685 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:06,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-04-24 18:05:06,686 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,686 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,686 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-24 18:05:06,734 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:06,734 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:06,734 INFO L139 ounterexampleChecker]: Examining path program with hash -342286852, occurence #1 [2025-04-24 18:05:06,734 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:06,734 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:06,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash -941851775, now seen corresponding path program 1 times [2025-04-24 18:05:06,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:06,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582203980] [2025-04-24 18:05:06,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:06,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 18:05:06,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 18:05:06,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:06,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:05:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:06,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582203980] [2025-04-24 18:05:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582203980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:06,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:06,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 18:05:06,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079475475] [2025-04-24 18:05:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:06,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-24 18:05:06,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:06,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-24 18:05:06,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-24 18:05:06,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,801 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:06,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-04-24 18:05:06,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:06,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-24 18:05:06,858 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:06,859 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:06,859 INFO L139 ounterexampleChecker]: Examining path program with hash -239566021, occurence #1 [2025-04-24 18:05:06,859 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:06,859 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:06,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1010797757, now seen corresponding path program 1 times [2025-04-24 18:05:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:06,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461441140] [2025-04-24 18:05:06,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 18:05:06,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 18:05:06,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:06,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:05:06,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:06,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461441140] [2025-04-24 18:05:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461441140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-24 18:05:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191212864] [2025-04-24 18:05:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:06,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 18:05:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:06,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 18:05:06,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-24 18:05:06,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:06,952 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:06,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-04-24 18:05:06,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:06,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:06,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:06,952 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:07,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:07,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:07,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:07,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-24 18:05:07,041 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:07,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:07,041 INFO L139 ounterexampleChecker]: Examining path program with hash 392547079, occurence #1 [2025-04-24 18:05:07,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:07,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:07,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -745795584, now seen corresponding path program 1 times [2025-04-24 18:05:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:07,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330130956] [2025-04-24 18:05:07,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:07,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 18:05:07,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 18:05:07,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:07,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:05:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:07,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330130956] [2025-04-24 18:05:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330130956] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-24 18:05:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25513740] [2025-04-24 18:05:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:07,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-24 18:05:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:07,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-24 18:05:07,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-04-24 18:05:07,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:07,169 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:07,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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-04-24 18:05:07,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:07,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:07,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:07,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:07,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:07,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:07,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:07,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 18:05:07,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-24 18:05:07,278 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:07,278 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:07,278 INFO L139 ounterexampleChecker]: Examining path program with hash 513968369, occurence #1 [2025-04-24 18:05:07,278 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:07,278 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:07,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 193869633, now seen corresponding path program 1 times [2025-04-24 18:05:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:07,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647738657] [2025-04-24 18:05:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:07,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-24 18:05:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-24 18:05:07,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:07,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:05:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:07,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647738657] [2025-04-24 18:05:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647738657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:07,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-24 18:05:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834771958] [2025-04-24 18:05:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:07,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-24 18:05:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:07,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-24 18:05:07,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-04-24 18:05:07,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:07,405 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:07,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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-04-24 18:05:07,405 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:07,405 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:07,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:07,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 18:05:07,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:07,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:07,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:07,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:07,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 18:05:07,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:05:07,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-24 18:05:07,540 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 18:05:07,540 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:07,540 INFO L139 ounterexampleChecker]: Examining path program with hash -1045390858, occurence #1 [2025-04-24 18:05:07,540 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:07,540 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:07,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:07,540 INFO L85 PathProgramCache]: Analyzing trace with hash -192110793, now seen corresponding path program 1 times [2025-04-24 18:05:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:07,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581938990] [2025-04-24 18:05:07,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:07,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-24 18:05:07,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-24 18:05:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:05:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-24 18:05:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:05:07,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581938990] [2025-04-24 18:05:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581938990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:05:07,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:05:07,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-24 18:05:07,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058183587] [2025-04-24 18:05:07,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:05:07,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-24 18:05:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:05:07,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-24 18:05:07,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-24 18:05:07,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:07,654 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:05:07,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 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-04-24 18:05:07,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:07,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:07,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:07,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:07,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-24 18:05:07,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:05:07,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-24 18:05:11,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:05:11,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-24 18:05:11,283 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:05:11,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-24 18:05:11,284 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-24 18:05:11,284 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of6ForFork0 was SAFE (4/7) [2025-04-24 18:05:11,285 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:11,286 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:11,286 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of6ForFork0 ======== [2025-04-24 18:05:11,286 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:11,286 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:05:14,713 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:05:14,714 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:05:14,714 INFO L320 ceAbstractionStarter]: Result for error location f2Thread6of6ForFork0 was SAFE (5/7) [2025-04-24 18:05:14,715 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:14,716 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:14,716 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:05:14,716 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:14,716 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 18:05:14,721 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:05:14,721 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:05:14,721 INFO L139 ounterexampleChecker]: Examining path program with hash -2085531701, occurence #1 [2025-04-24 18:05:14,721 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:05:14,721 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:05:14,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:05:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash -368456372, now seen corresponding path program 1 times [2025-04-24 18:05:14,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:05:14,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933699245] [2025-04-24 18:05:14,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:05:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:05:14,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-24 18:05:14,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-24 18:05:14,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:05:14,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:05:14,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-24 18:05:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-24 18:05:14,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:05:14,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:05:14,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:05:14,745 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:05:14,745 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 18:05:14,745 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-24 18:05:14,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-24 18:05:14,746 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-24 18:05:14,746 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (6/7) [2025-04-24 18:05:14,746 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 18:05:14,746 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-24 18:05:14,782 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:05:14,783 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:14,804 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:14,804 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of7ForFork0 ======== [2025-04-24 18:05:14,805 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:14,805 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:05:34,608 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:05:34,609 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:05:34,609 INFO L320 ceAbstractionStarter]: Result for error location f2Thread5of7ForFork0 was SAFE (1/8) [2025-04-24 18:05:34,610 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:34,611 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:34,611 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of7ForFork0 ======== [2025-04-24 18:05:34,611 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:34,611 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 18:05:53,552 INFO L790 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 18:05:53,553 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-24 18:05:53,553 INFO L320 ceAbstractionStarter]: Result for error location f2Thread3of7ForFork0 was SAFE (2/8) [2025-04-24 18:05:53,554 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:53,555 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:05:53,555 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of7ForFork0 ======== [2025-04-24 18:05:53,555 INFO L340 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;@6c9395bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:05:53,555 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.