./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/twostage_3.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 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/twostage_3.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 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 02:09:46,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 02:09:46,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 02:09:46,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 02:09:46,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 02:09:46,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 02:09:46,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 02:09:46,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 02:09:46,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 02:09:46,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 02:09:46,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 02:09:46,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 02:09:46,349 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 02:09:46,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 02:09:46,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 02:09:46,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:09:46,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 02:09:46,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:09:46,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 02:09:46,351 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 02:09:46,351 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 -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 02:09:46,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 02:09:46,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 02:09:46,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 02:09:46,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 02:09:46,581 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 02:09:46,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-04-25 02:09:47,877 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e62f9b9e9/695f5ffe0ff5412cac0240fa7baddc51/FLAG913bcb14c [2025-04-25 02:09:48,165 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 02:09:48,167 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-04-25 02:09:48,183 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e62f9b9e9/695f5ffe0ff5412cac0240fa7baddc51/FLAG913bcb14c [2025-04-25 02:09:48,878 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e62f9b9e9/695f5ffe0ff5412cac0240fa7baddc51 [2025-04-25 02:09:48,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 02:09:48,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 02:09:48,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 02:09:48,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 02:09:48,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 02:09:48,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:09:48" (1/1) ... [2025-04-25 02:09:48,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c536814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:48, skipping insertion in model container [2025-04-25 02:09:48,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:09:48" (1/1) ... [2025-04-25 02:09:48,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 02:09:49,240 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/twostage_3.i[59093,59106] [2025-04-25 02:09:49,259 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:49,262 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:49,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:09:49,269 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 02:09:49,335 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/twostage_3.i[59093,59106] [2025-04-25 02:09:49,341 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:49,342 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:49,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:09:49,401 INFO L204 MainTranslator]: Completed translation [2025-04-25 02:09:49,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49 WrapperNode [2025-04-25 02:09:49,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 02:09:49,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 02:09:49,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 02:09:49,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 02:09:49,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,453 INFO L138 Inliner]: procedures = 373, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-04-25 02:09:49,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 02:09:49,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 02:09:49,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 02:09:49,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 02:09:49,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 02:09:49,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 02:09:49,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 02:09:49,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 02:09:49,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (1/1) ... [2025-04-25 02:09:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:09:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:09:49,515 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-25 02:09:49,517 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-25 02:09:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-04-25 02:09:49,535 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-04-25 02:09:49,536 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 02:09:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 02:09:49,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 02:09:49,537 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 02:09:49,661 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 02:09:49,663 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 02:09:49,906 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 02:09:49,906 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 02:09:50,106 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 02:09:50,107 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 02:09:50,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:09:50 BoogieIcfgContainer [2025-04-25 02:09:50,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 02:09:50,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 02:09:50,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 02:09:50,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 02:09:50,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 02:09:48" (1/3) ... [2025-04-25 02:09:50,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546793fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:09:50, skipping insertion in model container [2025-04-25 02:09:50,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:49" (2/3) ... [2025-04-25 02:09:50,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546793fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:09:50, skipping insertion in model container [2025-04-25 02:09:50,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:09:50" (3/3) ... [2025-04-25 02:09:50,114 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-04-25 02:09:50,124 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 02:09:50,125 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-25 02:09:50,126 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 02:09:50,171 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-25 02:09:50,206 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:09:50,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 02:09:50,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:09:50,209 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-25 02:09:50,210 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-25 02:09:50,272 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:09:50,279 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:09:50,285 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;@27113a89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:09:50,285 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:09:50,353 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:09:50,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1566334335, now seen corresponding path program 1 times [2025-04-25 02:09:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:50,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215021313] [2025-04-25 02:09:50,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 02:09:50,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 02:09:50,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:50,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:09:50,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:09:50,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 02:09:50,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 02:09:50,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:50,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:09:50,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:09:50,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:09:50,546 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:09:50,548 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 02:09:50,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 02:09:50,553 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-25 02:09:50,554 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-04-25 02:09:50,554 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:09:50,554 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-25 02:09:50,589 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-25 02:09:50,594 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:09:50,605 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:09:50,606 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-04-25 02:09:50,606 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;@27113a89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:09:50,606 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 02:09:50,775 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:09:50,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1478320724, now seen corresponding path program 1 times [2025-04-25 02:09:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:50,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488448067] [2025-04-25 02:09:50,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:50,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 02:09:50,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 02:09:50,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:50,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:09:50,945 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-25 02:09:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:09:50,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488448067] [2025-04-25 02:09:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488448067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:09:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:09:50,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:09:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917583533] [2025-04-25 02:09:50,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:09:50,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:09:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:09:50,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:09:50,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:09:50,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:50,963 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:09:50,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:09:50,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:51,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:51,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 02:09:51,343 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:09:51,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1437758113, now seen corresponding path program 1 times [2025-04-25 02:09:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:51,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802695651] [2025-04-25 02:09:51,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:51,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:09:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:09:51,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:09:51,683 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-25 02:09:51,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:09:51,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802695651] [2025-04-25 02:09:51,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802695651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:09:51,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:09:51,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 02:09:51,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872877437] [2025-04-25 02:09:51,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:09:51,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:09:51,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:09:51,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:09:51,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:09:51,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:51,686 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:09:51,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-25 02:09:51,686 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:51,686 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:52,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:52,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:52,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 02:09:52,399 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:09:52,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1303206273, now seen corresponding path program 2 times [2025-04-25 02:09:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:52,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915848901] [2025-04-25 02:09:52,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:09:52,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:52,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:09:52,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:09:52,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:09:52,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:09:52,599 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-25 02:09:52,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:09:52,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915848901] [2025-04-25 02:09:52,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915848901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:09:52,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:09:52,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 02:09:52,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599860056] [2025-04-25 02:09:52,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:09:52,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 02:09:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:09:52,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 02:09:52,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-25 02:09:52,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:52,601 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:09:52,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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-25 02:09:52,601 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:52,601 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:52,601 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:52,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:52,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:52,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:52,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 02:09:52,867 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:09:52,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:52,867 INFO L85 PathProgramCache]: Analyzing trace with hash -777658887, now seen corresponding path program 1 times [2025-04-25 02:09:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:52,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004913991] [2025-04-25 02:09:52,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:52,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-25 02:09:52,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-25 02:09:52,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:52,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:09:53,039 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-25 02:09:53,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:09:53,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004913991] [2025-04-25 02:09:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004913991] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:09:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:09:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 02:09:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103945460] [2025-04-25 02:09:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:09:53,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:09:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:09:53,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:09:53,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:09:53,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:53,041 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:09:53,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-25 02:09:53,041 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:53,041 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,041 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,041 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:53,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:53,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:09:53,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 02:09:53,319 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:09:53,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -680248872, now seen corresponding path program 1 times [2025-04-25 02:09:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:53,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254091190] [2025-04-25 02:09:53,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:53,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:53,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-25 02:09:53,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-25 02:09:53,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:53,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:09:53,575 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-25 02:09:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:09:53,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254091190] [2025-04-25 02:09:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254091190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:09:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:09:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-25 02:09:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945781165] [2025-04-25 02:09:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:09:53,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:09:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:09:53,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:09:53,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:09:53,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:53,576 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:09:53,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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-25 02:09:53,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:53,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:09:53,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:09:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:09:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:09:53,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:09:53,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:09:53,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 02:09:53,882 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:09:53,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1285698784, now seen corresponding path program 1 times [2025-04-25 02:09:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:09:53,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227161152] [2025-04-25 02:09:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:09:53,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-25 02:09:53,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-25 02:09:53,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:53,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:09:53,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:09:53,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-25 02:09:53,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-25 02:09:53,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:09:53,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:09:53,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:09:53,969 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:09:53,969 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 02:09:53,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 02:09:53,970 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-25 02:09:53,970 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-04-25 02:09:54,066 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-25 02:09:54,066 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 02:09:54,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 02:09:54,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 02:09:54 BasicIcfg [2025-04-25 02:09:54,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 02:09:54,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 02:09:54,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 02:09:54,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 02:09:54,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:09:50" (3/4) ... [2025-04-25 02:09:54,083 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-25 02:09:54,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 02:09:54,085 INFO L158 Benchmark]: Toolchain (without parser) took 5203.38ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 104.7MB in the beginning and 153.2MB in the end (delta: -48.5MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2025-04-25 02:09:54,085 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:09:54,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.91ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 63.0MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-25 02:09:54,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:09:54,086 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 59.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-25 02:09:54,086 INFO L158 Benchmark]: RCFGBuilder took 622.22ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 82.9MB in the end (delta: -23.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-04-25 02:09:54,086 INFO L158 Benchmark]: TraceAbstraction took 3972.35ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 82.2MB in the beginning and 153.3MB in the end (delta: -71.1MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-04-25 02:09:54,087 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 318.8MB. Free memory was 153.3MB in the beginning and 153.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:09:54,088 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.91ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 63.0MB in the end (delta: 41.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 60.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 142.6MB. Free memory was 60.7MB in the beginning and 59.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 622.22ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 82.9MB in the end (delta: -23.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3972.35ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 82.2MB in the beginning and 153.3MB in the end (delta: -71.1MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 318.8MB. Free memory was 153.3MB in the beginning and 153.2MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 399, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 399, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 409, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 399, unknown conditional: 0, unknown unconditional: 399] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 14, Number of trivial persistent sets: 12, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 399, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 399, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 409, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 399, unknown conditional: 0, unknown unconditional: 399] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4147, independent: 4028, independent conditional: 0, independent unconditional: 4028, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4147, independent: 4028, independent conditional: 0, independent unconditional: 4028, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3955, independent: 3836, independent conditional: 0, independent unconditional: 3836, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3955, independent: 3758, independent conditional: 0, independent unconditional: 3758, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4147, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3955, unknown conditional: 0, unknown unconditional: 3955] , Statistics on independence cache: Total cache size (in pairs): 4354, Positive cache size: 4226, Positive conditional cache size: 0, Positive unconditional cache size: 4226, Negative cache size: 128, Negative conditional cache size: 0, Negative unconditional cache size: 128, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 2259, Number of trivial persistent sets: 240, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4147, independent: 4028, independent conditional: 0, independent unconditional: 4028, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4147, independent: 4028, independent conditional: 0, independent unconditional: 4028, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3955, independent: 3836, independent conditional: 0, independent unconditional: 3836, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3955, independent: 3758, independent conditional: 0, independent unconditional: 3758, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4147, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3955, unknown conditional: 0, unknown unconditional: 3955] , Statistics on independence cache: Total cache size (in pairs): 4354, Positive cache size: 4226, Positive conditional cache size: 0, Positive unconditional cache size: 4226, Negative cache size: 128, Negative conditional cache size: 0, Negative unconditional cache size: 128, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] EXPR, FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1310] EXPR 0 err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) [L1310] COND FALSE 0 !(0 != (err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)))) [L1309] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, rPool={6:0}, tPool={5:0}] [L1309] COND TRUE 0 i < iRThreads [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1, t2=-1] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=-1, t2=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=-1, t2=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={53:54}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={6:0}, t1=1, t1=1, t2=0, tPool={5:0}] [L1258] 3 int t1 = -1; [L1259] 3 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1261] COND FALSE 3 !(data1Value == 0) [L1265] 3 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1268] 3 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 80 locations, 89 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread2of2ForFork0 with 1 thread instances CFG has 7 procedures, 112 locations, 127 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 2.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-25 02:09:54,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/twostage_3.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.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 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 02:09:55,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 02:09:55,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-04-25 02:09:55,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 02:09:55,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 02:09:55,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 02:09:55,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 02:09:55,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 02:09:55,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 02:09:55,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 02:09:55,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 02:09:55,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 02:09:55,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 02:09:55,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:09:55,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:09:55,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 02:09:55,991 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 02:09:55,992 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 02:09:55,992 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 -> 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 02:09:56,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 02:09:56,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 02:09:56,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 02:09:56,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 02:09:56,239 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 02:09:56,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-04-25 02:09:57,486 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4c64f0596/e8efae836ec34487be9d13095c7b3a51/FLAG5c45595ad [2025-04-25 02:09:57,748 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 02:09:57,751 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-04-25 02:09:57,769 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4c64f0596/e8efae836ec34487be9d13095c7b3a51/FLAG5c45595ad [2025-04-25 02:09:58,536 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4c64f0596/e8efae836ec34487be9d13095c7b3a51 [2025-04-25 02:09:58,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 02:09:58,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 02:09:58,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 02:09:58,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 02:09:58,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 02:09:58,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:09:58" (1/1) ... [2025-04-25 02:09:58,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73af704e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:58, skipping insertion in model container [2025-04-25 02:09:58,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:09:58" (1/1) ... [2025-04-25 02:09:58,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 02:09:58,907 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/twostage_3.i[59093,59106] [2025-04-25 02:09:58,925 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:58,925 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:58,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:09:58,937 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 02:09:58,997 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/twostage_3.i[59093,59106] [2025-04-25 02:09:59,010 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:59,011 WARN L1772 CHandler]: Possible shadowing of function lock [2025-04-25 02:09:59,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:09:59,078 INFO L204 MainTranslator]: Completed translation [2025-04-25 02:09:59,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59 WrapperNode [2025-04-25 02:09:59,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 02:09:59,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 02:09:59,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 02:09:59,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 02:09:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,122 INFO L138 Inliner]: procedures = 376, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2025-04-25 02:09:59,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 02:09:59,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 02:09:59,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 02:09:59,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 02:09:59,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,142 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 02:09:59,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 02:09:59,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 02:09:59,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 02:09:59,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (1/1) ... [2025-04-25 02:09:59,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:09:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:09:59,175 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-25 02:09:59,177 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-25 02:09:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-04-25 02:09:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-04-25 02:09:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-04-25 02:09:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-25 02:09:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-25 02:09:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 02:09:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 02:09:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 02:09:59,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 02:09:59,198 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 02:09:59,346 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 02:09:59,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 02:09:59,588 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 02:09:59,589 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 02:09:59,737 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 02:09:59,738 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 02:09:59,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:09:59 BoogieIcfgContainer [2025-04-25 02:09:59,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 02:09:59,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 02:09:59,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 02:09:59,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 02:09:59,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 02:09:58" (1/3) ... [2025-04-25 02:09:59,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cf955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:09:59, skipping insertion in model container [2025-04-25 02:09:59,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:09:59" (2/3) ... [2025-04-25 02:09:59,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cf955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:09:59, skipping insertion in model container [2025-04-25 02:09:59,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:09:59" (3/3) ... [2025-04-25 02:09:59,744 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-04-25 02:09:59,752 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 02:09:59,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 49 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-25 02:09:59,754 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 02:09:59,791 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-25 02:09:59,820 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:09:59,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 02:09:59,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:09:59,823 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-25 02:09:59,825 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-25 02:09:59,889 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:09:59,895 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:09:59,900 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;@d4e10ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:09:59,900 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:09:59,966 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:09:59,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:09:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2055467201, now seen corresponding path program 1 times [2025-04-25 02:09:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:09:59,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794351813] [2025-04-25 02:09:59,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:09:59,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:09:59,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:09:59,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:09:59,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 02:10:00,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 02:10:00,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 02:10:00,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:00,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:10:00,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:10:00,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 02:10:00,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 02:10:00,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:00,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:10:00,175 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-25 02:10:00,176 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:10:00,176 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:10:00,178 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 02:10:00,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 02:10:00,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:00,383 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-25 02:10:00,384 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-04-25 02:10:00,384 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:10:00,384 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-25 02:10:00,408 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-25 02:10:00,411 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:10:00,419 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:10:00,420 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-04-25 02:10:00,420 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;@d4e10ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:10:00,420 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 02:10:00,567 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:10:00,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:10:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1256097172, now seen corresponding path program 1 times [2025-04-25 02:10:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:10:00,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339995757] [2025-04-25 02:10:00,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:10:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:10:00,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:10:00,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 02:10:00,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 02:10:00,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 02:10:00,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:00,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:10:00,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-25 02:10:00,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:10:00,704 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-25 02:10:00,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:10:00,704 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 02:10:00,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339995757] [2025-04-25 02:10:00,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339995757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:10:00,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:10:00,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:10:00,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977104363] [2025-04-25 02:10:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:10:00,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:10:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 02:10:00,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:10:00,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:10:00,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:00,723 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:10:00,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:10:00,724 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:01,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:01,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 02:10:01,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:01,319 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:10:01,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:10:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1933576989, now seen corresponding path program 1 times [2025-04-25 02:10:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:10:01,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42341524] [2025-04-25 02:10:01,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:10:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:10:01,322 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:10:01,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 02:10:01,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:10:01,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:10:01,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:01,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:10:01,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 02:10:01,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:10:01,613 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-25 02:10:01,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:10:01,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 02:10:01,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42341524] [2025-04-25 02:10:01,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42341524] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:10:01,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:10:01,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 02:10:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698641791] [2025-04-25 02:10:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:10:01,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:10:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 02:10:01,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:10:01,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:10:01,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:01,618 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:10:01,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-25 02:10:01,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:01,618 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:02,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:02,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:02,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 02:10:02,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:02,590 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:10:02,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:10:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 379574079, now seen corresponding path program 2 times [2025-04-25 02:10:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:10:02,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001206773] [2025-04-25 02:10:02,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:10:02,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:02,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:10:02,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:10:02,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 02:10:02,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:10:02,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:10:02,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:10:02,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:10:02,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 02:10:02,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:10:02,800 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-25 02:10:02,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:10:02,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 02:10:02,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001206773] [2025-04-25 02:10:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001206773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:10:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:10:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-25 02:10:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506415440] [2025-04-25 02:10:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:10:02,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-25 02:10:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 02:10:02,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-25 02:10:02,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-25 02:10:02,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:02,801 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:10:02,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 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-25 02:10:02,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:02,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:02,801 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:03,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:03,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:03,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:03,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-25 02:10:03,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:03,262 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:10:03,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:10:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2054379463, now seen corresponding path program 1 times [2025-04-25 02:10:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:10:03,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754273046] [2025-04-25 02:10:03,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:10:03,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:10:03,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:10:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-25 02:10:03,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-25 02:10:03,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-25 02:10:03,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:03,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:10:03,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 02:10:03,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:10:03,495 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-25 02:10:03,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:10:03,495 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 02:10:03,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754273046] [2025-04-25 02:10:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754273046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:10:03,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:10:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 02:10:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765144551] [2025-04-25 02:10:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:10:03,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:10:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 02:10:03,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:10:03,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:10:03,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:03,497 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:10:03,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-25 02:10:03,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:03,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:03,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:03,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:03,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:03,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:03,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:03,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:10:03,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-25 02:10:04,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:04,057 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:10:04,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:10:04,057 INFO L85 PathProgramCache]: Analyzing trace with hash 864789592, now seen corresponding path program 1 times [2025-04-25 02:10:04,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:10:04,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136493449] [2025-04-25 02:10:04,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:10:04,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:04,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:10:04,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:10:04,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-25 02:10:04,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-25 02:10:04,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-25 02:10:04,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:04,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:10:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 02:10:04,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:10:04,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-25 02:10:04,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-04-25 02:10:04,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 02:10:04,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-25 02:10:04,262 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-25 02:10:04,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:10:04,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-25 02:10:04,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136493449] [2025-04-25 02:10:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136493449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:10:04,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:10:04,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:10:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418760730] [2025-04-25 02:10:04,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:10:04,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:10:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-25 02:10:04,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:10:04,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:10:04,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:04,264 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:10:04,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 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-25 02:10:04,264 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:04,264 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:04,264 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:04,264 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:10:04,264 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:10:04,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:10:04,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:04,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:10:04,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:10:04,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:10:04,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-25 02:10:04,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:04,781 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:10:04,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:10:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 781349406, now seen corresponding path program 1 times [2025-04-25 02:10:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-25 02:10:04,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326091051] [2025-04-25 02:10:04,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:10:04,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:04,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:10:04,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:10:04,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-25 02:10:04,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-25 02:10:04,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-25 02:10:04,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:04,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:10:04,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:10:04,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-25 02:10:05,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-25 02:10:05,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:10:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:10:05,050 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-25 02:10:05,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:10:05,051 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 02:10:05,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-25 02:10:05,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:10:05,252 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-04-25 02:10:05,252 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-04-25 02:10:05,333 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-25 02:10:05,333 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 02:10:05,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 02:10:05,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 02:10:05 BasicIcfg [2025-04-25 02:10:05,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 02:10:05,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 02:10:05,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 02:10:05,342 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 02:10:05,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:09:59" (3/4) ... [2025-04-25 02:10:05,344 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-25 02:10:05,344 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 02:10:05,345 INFO L158 Benchmark]: Toolchain (without parser) took 6805.73ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 90.8MB in the beginning and 78.0MB in the end (delta: 12.8MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2025-04-25 02:10:05,345 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:10:05,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.05ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 47.8MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-04-25 02:10:05,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.50ms. Allocated memory is still 117.4MB. Free memory was 47.8MB in the beginning and 44.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:10:05,345 INFO L158 Benchmark]: Boogie Preprocessor took 30.65ms. Allocated memory is still 117.4MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:10:05,345 INFO L158 Benchmark]: RCFGBuilder took 583.80ms. Allocated memory is still 117.4MB. Free memory was 42.8MB in the beginning and 86.4MB in the end (delta: -43.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-04-25 02:10:05,346 INFO L158 Benchmark]: TraceAbstraction took 5602.00ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 86.4MB in the beginning and 78.1MB in the end (delta: 8.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2025-04-25 02:10:05,346 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 176.2MB. Free memory was 78.1MB in the beginning and 78.0MB in the end (delta: 34.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:10:05,346 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 46.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.05ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 47.8MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.50ms. Allocated memory is still 117.4MB. Free memory was 47.8MB in the beginning and 44.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.65ms. Allocated memory is still 117.4MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 583.80ms. Allocated memory is still 117.4MB. Free memory was 42.8MB in the beginning and 86.4MB in the end (delta: -43.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5602.00ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 86.4MB in the beginning and 78.1MB in the end (delta: 8.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 176.2MB. Free memory was 78.1MB in the beginning and 78.0MB in the end (delta: 34.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 399, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 399, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 409, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 399, unknown conditional: 0, unknown unconditional: 399] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 14, Number of trivial persistent sets: 12, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 399, independent: 390, independent conditional: 0, independent unconditional: 390, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 399, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 409, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 399, unknown conditional: 0, unknown unconditional: 399] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4125, independent: 4006, independent conditional: 0, independent unconditional: 4006, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4125, independent: 4006, independent conditional: 0, independent unconditional: 4006, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3933, independent: 3814, independent conditional: 0, independent unconditional: 3814, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3933, independent: 3736, independent conditional: 0, independent unconditional: 3736, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 333, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4125, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3933, unknown conditional: 0, unknown unconditional: 3933] , Statistics on independence cache: Total cache size (in pairs): 4332, Positive cache size: 4204, Positive conditional cache size: 0, Positive unconditional cache size: 4204, Negative cache size: 128, Negative conditional cache size: 0, Negative unconditional cache size: 128, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 2264, Number of trivial persistent sets: 240, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4125, independent: 4006, independent conditional: 0, independent unconditional: 4006, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4125, independent: 4006, independent conditional: 0, independent unconditional: 4006, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3933, independent: 3814, independent conditional: 0, independent unconditional: 3814, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3933, independent: 3736, independent conditional: 0, independent unconditional: 3736, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 197, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 333, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4125, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3933, unknown conditional: 0, unknown unconditional: 3933] , Statistics on independence cache: Total cache size (in pairs): 4332, Positive cache size: 4204, Positive conditional cache size: 0, Positive unconditional cache size: 4204, Negative cache size: 128, Negative conditional cache size: 0, Negative unconditional cache size: 128, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - UnprovableResult [Line: 1272]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of sscanf at line 1284. Possible FailurePath: [L1236] 0 static int iTThreads = 2; [L1237] 0 static int iRThreads = 1; [L1238] 0 static int data1Value = 0; [L1239] 0 static int data2Value = 0; [L1240] 0 pthread_mutex_t *data1Lock; [L1241] 0 pthread_mutex_t *data2Lock; [L1278] 0 int i,err; [L1279] COND TRUE 0 argc != 1 [L1280] COND FALSE 0 !(argc != 3) [L1288] COND FALSE 0 !(iTThreads > 100000 || iRThreads > 100000) [L1291] 0 data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1292] 0 data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1293] EXPR 0 err = pthread_mutex_init(data1Lock, ((void *)0)) [L1293] COND FALSE 0 !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1297] EXPR 0 err = pthread_mutex_init(data2Lock, ((void *)0)) [L1297] COND FALSE 0 !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1301] 0 pthread_t tPool[iTThreads]; [L1302] 0 pthread_t rPool[iRThreads]; [L1303] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={519:0}, tPool={7:0}] [L1303] COND TRUE 0 i < iTThreads [L1304] EXPR, FCALL, FORK 0 pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={519:0}, tPool={7:0}] [L1304] EXPR 0 err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)) [L1304] COND FALSE 0 !(0 != (err = pthread_create(&tPool[i], ((void *)0), &funcA, ((void *)0)))) [L1303] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, rPool={519:0}, tPool={7:0}] [L1303] COND FALSE 0 !(i < iTThreads) [L1309] 0 i = 0 VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={519:0}, tPool={7:0}] [L1309] COND TRUE 0 i < iRThreads [L1310] EXPR, FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={519:0}, tPool={7:0}] [L1310] EXPR 0 err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) [L1310] COND FALSE 0 !(0 != (err = pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)))) [L1309] 0 i++ VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, rPool={519:0}, tPool={7:0}] [L1309] COND TRUE 0 i < iRThreads [L1258] 2 int t1 = -1; [L1259] 2 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1, t2=-1] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=0, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=-1, t2=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=-1, t2=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 2 !(data1Value == 0) [L1265] 2 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 2 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 2 t2 != (t1 + 1) [L1272] 2 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1310] FCALL, FORK 0 pthread_create(&rPool[i], ((void *)0), &funcB, ((void *)0)) VAL [\at(argc, Pre)=3, \at(argv, Pre)={0:0}, \at(param, Pre)={0:0}, \at(param, Pre)={0:0}, argc=3, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={519:0}, t1=1, t1=1, t2=0, tPool={7:0}] [L1258] 3 int t1 = -1; [L1259] 3 int t2 = -1; VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=-1, t1=1, t2=-1] [L1261] COND FALSE 3 !(data1Value == 0) [L1265] 3 t1 = data1Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=-1] [L1268] 3 t2 = data2Value VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={5:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 80 locations, 89 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: funcBThread2of2ForFork0 with 1 thread instances CFG has 7 procedures, 112 locations, 127 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 2.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 848 SizeOfPredicates, 9 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-25 02:10:05,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample