./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 6f232940 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-6f23294-m [2025-03-19 23:47:05,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 23:47:05,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 23:47:05,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 23:47:05,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 23:47:05,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 23:47:05,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 23:47:05,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 23:47:05,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 23:47:05,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 23:47:05,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 23:47:05,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 23:47:05,896 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 23:47:05,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 23:47:05,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 23:47:05,896 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 23:47:05,897 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 23:47:05,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 23:47:05,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 23:47:05,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 23:47:05,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 23:47:05,899 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 23:47:05,899 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 23:47:05,899 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-03-19 23:47:06,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 23:47:06,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 23:47:06,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 23:47:06,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 23:47:06,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 23:47:06,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-03-19 23:47:07,446 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9880f3d48/613b3582e4a24d9d910da53378ce9692/FLAG972c521b2 [2025-03-19 23:47:07,639 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 23:47:07,639 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-03-19 23:47:07,657 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9880f3d48/613b3582e4a24d9d910da53378ce9692/FLAG972c521b2 [2025-03-19 23:47:08,647 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9880f3d48/613b3582e4a24d9d910da53378ce9692 [2025-03-19 23:47:08,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 23:47:08,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 23:47:08,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 23:47:08,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 23:47:08,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 23:47:08,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:47:08" (1/1) ... [2025-03-19 23:47:08,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c49f736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:08, skipping insertion in model container [2025-03-19 23:47:08,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:47:08" (1/1) ... [2025-03-19 23:47:08,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 23:47:09,087 WARN L250 ndardFunctionHandler]: 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-03-19 23:47:09,101 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:09,101 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:09,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 23:47:09,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 23:47:09,190 WARN L250 ndardFunctionHandler]: 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-03-19 23:47:09,200 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:09,203 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:09,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 23:47:09,268 INFO L204 MainTranslator]: Completed translation [2025-03-19 23:47:09,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09 WrapperNode [2025-03-19 23:47:09,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 23:47:09,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 23:47:09,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 23:47:09,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 23:47:09,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,312 INFO L138 Inliner]: procedures = 373, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-03-19 23:47:09,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 23:47:09,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 23:47:09,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 23:47:09,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 23:47:09,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 23:47:09,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 23:47:09,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 23:47:09,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 23:47:09,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (1/1) ... [2025-03-19 23:47:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 23:47:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:09,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 23:47:09,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-03-19 23:47:09,390 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-03-19 23:47:09,390 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-19 23:47:09,390 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-19 23:47:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-19 23:47:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 23:47:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 23:47:09,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 23:47:09,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 23:47:09,392 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 23:47:09,491 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 23:47:09,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 23:47:09,690 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 23:47:09,690 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 23:47:09,848 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 23:47:09,849 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 23:47:09,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:47:09 BoogieIcfgContainer [2025-03-19 23:47:09,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 23:47:09,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 23:47:09,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 23:47:09,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 23:47:09,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 11:47:08" (1/3) ... [2025-03-19 23:47:09,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42faa73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:47:09, skipping insertion in model container [2025-03-19 23:47:09,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:09" (2/3) ... [2025-03-19 23:47:09,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42faa73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:47:09, skipping insertion in model container [2025-03-19 23:47:09,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:47:09" (3/3) ... [2025-03-19 23:47:09,858 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-03-19 23:47:09,867 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 23:47:09,870 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-03-19 23:47:09,870 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 23:47:09,910 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-19 23:47:09,943 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:09,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 23:47:09,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:09,946 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-03-19 23:47:09,948 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-03-19 23:47:10,004 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 23:47:10,031 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 23:47:10,036 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;@6e3dde5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:10,038 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-19 23:47:10,261 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 23:47:10,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1566334335, now seen corresponding path program 1 times [2025-03-19 23:47:10,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:10,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718025631] [2025-03-19 23:47:10,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:10,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-19 23:47:10,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-19 23:47:10,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:10,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:10,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 23:47:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-19 23:47:10,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-19 23:47:10,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:10,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:10,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 23:47:10,465 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 23:47:10,465 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-19 23:47:10,466 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-19 23:47:10,467 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 23:47:10,470 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-19 23:47:10,471 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-03-19 23:47:10,472 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-19 23:47:10,472 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-19 23:47:10,490 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-19 23:47:10,493 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:10,500 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 23:47:10,501 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-03-19 23:47:10,501 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;@6e3dde5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:10,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 23:47:11,037 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:11,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1478320724, now seen corresponding path program 1 times [2025-03-19 23:47:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172480073] [2025-03-19 23:47:11,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:11,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-19 23:47:11,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-19 23:47:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 23:47:11,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172480073] [2025-03-19 23:47:11,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172480073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-19 23:47:11,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193386664] [2025-03-19 23:47:11,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:11,179 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 23:47:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 23:47:11,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 23:47:11,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 23:47:11,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:11,195 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:11,196 INFO L481 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-03-19 23:47:11,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:11,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:11,979 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-19 23:47:11,979 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:11,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:11,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1437758113, now seen corresponding path program 1 times [2025-03-19 23:47:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102647354] [2025-03-19 23:47:11,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:11,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-19 23:47:12,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-19 23:47:12,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:12,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 23:47:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102647354] [2025-03-19 23:47:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102647354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:12,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:12,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-19 23:47:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602891715] [2025-03-19 23:47:12,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:12,304 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 23:47:12,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 23:47:12,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 23:47:12,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-19 23:47:12,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:12,307 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:12,307 INFO L481 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-03-19 23:47:12,307 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:12,307 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:13,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:13,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,170 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 23:47:13,170 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:13,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1303206273, now seen corresponding path program 2 times [2025-03-19 23:47:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537985036] [2025-03-19 23:47:13,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 23:47:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:13,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-19 23:47:13,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-19 23:47:13,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 23:47:13,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:13,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 23:47:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537985036] [2025-03-19 23:47:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537985036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-19 23:47:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141185517] [2025-03-19 23:47:13,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:13,324 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-19 23:47:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 23:47:13,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-19 23:47:13,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-19 23:47:13,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:13,325 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:13,325 INFO L481 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-03-19 23:47:13,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:13,325 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,326 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:13,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:13,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,505 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-19 23:47:13,505 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:13,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash -777658887, now seen corresponding path program 1 times [2025-03-19 23:47:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:13,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510158277] [2025-03-19 23:47:13,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:13,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-19 23:47:13,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-19 23:47:13,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:13,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 23:47:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510158277] [2025-03-19 23:47:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510158277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-19 23:47:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588317455] [2025-03-19 23:47:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:13,678 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 23:47:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 23:47:13,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 23:47:13,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-19 23:47:13,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:13,679 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:13,679 INFO L481 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-03-19 23:47:13,679 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:13,679 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,679 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,679 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:13,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:13,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:13,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 23:47:13,922 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-19 23:47:13,922 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:13,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash -680248872, now seen corresponding path program 1 times [2025-03-19 23:47:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:13,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409310276] [2025-03-19 23:47:13,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:13,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-19 23:47:13,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-19 23:47:13,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:13,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 23:47:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409310276] [2025-03-19 23:47:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409310276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:14,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:14,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-19 23:47:14,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85734384] [2025-03-19 23:47:14,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:14,146 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 23:47:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 23:47:14,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 23:47:14,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-19 23:47:14,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:14,147 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:14,147 INFO L481 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-03-19 23:47:14,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:14,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:14,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:14,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-19 23:47:14,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:14,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:14,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:14,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:14,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 23:47:14,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-19 23:47:14,481 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-19 23:47:14,481 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:14,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:14,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1285698784, now seen corresponding path program 1 times [2025-03-19 23:47:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 23:47:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340760698] [2025-03-19 23:47:14,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 23:47:14,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 23:47:14,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 23:47:14,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:14,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:14,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 23:47:14,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 23:47:14,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 23:47:14,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:14,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:14,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-19 23:47:14,556 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 23:47:14,556 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-19 23:47:14,556 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-19 23:47:14,557 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-19 23:47:14,557 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-03-19 23:47:14,635 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-19 23:47:14,635 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-19 23:47:14,643 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-03-19 23:47:14,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 11:47:14 BasicIcfg [2025-03-19 23:47:14,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-19 23:47:14,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-19 23:47:14,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-19 23:47:14,645 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-19 23:47:14,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:47:09" (3/4) ... [2025-03-19 23:47:14,648 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-19 23:47:14,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-19 23:47:14,649 INFO L158 Benchmark]: Toolchain (without parser) took 5998.61ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 89.9MB in the beginning and 65.8MB in the end (delta: 24.2MB). Peak memory consumption was 97.1MB. Max. memory is 16.1GB. [2025-03-19 23:47:14,650 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 23:47:14,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.16ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 47.7MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-19 23:47:14,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 117.4MB. Free memory was 47.4MB in the beginning and 45.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-19 23:47:14,651 INFO L158 Benchmark]: Boogie Preprocessor took 32.42ms. Allocated memory is still 117.4MB. Free memory was 45.2MB in the beginning and 43.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 23:47:14,651 INFO L158 Benchmark]: RCFGBuilder took 504.14ms. Allocated memory is still 117.4MB. Free memory was 43.5MB in the beginning and 53.4MB in the end (delta: -10.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-19 23:47:14,652 INFO L158 Benchmark]: TraceAbstraction took 4792.94ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 52.7MB in the beginning and 65.8MB in the end (delta: -13.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2025-03-19 23:47:14,652 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 184.5MB. Free memory was 65.8MB in the beginning and 65.8MB in the end (delta: 10.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-19 23:47:14,653 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.20ms. Allocated memory is still 83.9MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.16ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 47.7MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 117.4MB. Free memory was 47.4MB in the beginning and 45.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.42ms. Allocated memory is still 117.4MB. Free memory was 45.2MB in the beginning and 43.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 504.14ms. Allocated memory is still 117.4MB. Free memory was 43.5MB in the beginning and 53.4MB in the end (delta: -10.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4792.94ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 52.7MB in the beginning and 65.8MB in the end (delta: -13.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 184.5MB. Free memory was 65.8MB in the beginning and 65.8MB in the end (delta: 10.9kB). Peak memory consumption was 8.4MB. 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: 189, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 106, dependent conditional: 0, dependent unconditional: 106, 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.2s, 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: 189, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 106, dependent conditional: 0, dependent unconditional: 106, 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: 1426, independent: 492, independent conditional: 0, independent unconditional: 492, dependent: 934, dependent conditional: 0, dependent unconditional: 934, 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: 1.7s, Number of persistent set computation: 2259, 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: 1426, independent: 492, independent conditional: 0, independent unconditional: 492, dependent: 934, dependent conditional: 0, dependent unconditional: 934, 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)={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.5s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.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: 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: 4.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 2.9s, 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-03-19 23:47:14,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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-6f23294-m [2025-03-19 23:47:16,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 23:47:16,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-03-19 23:47:16,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 23:47:16,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 23:47:16,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 23:47:16,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 23:47:16,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 23:47:16,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 23:47:16,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 23:47:16,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 23:47:16,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 23:47:16,522 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 23:47:16,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 23:47:16,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-19 23:47:16,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 23:47:16,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 23:47:16,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 23:47:16,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 23:47:16,527 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-19 23:47:16,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 23:47:16,528 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 23:47:16,528 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 23:47:16,528 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-03-19 23:47:16,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 23:47:16,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 23:47:16,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 23:47:16,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 23:47:16,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 23:47:16,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/twostage_3.i [2025-03-19 23:47:18,115 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/64f422153/2a4e4bf379914781a764c2b84b211e66/FLAGd09bccdd9 [2025-03-19 23:47:18,359 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 23:47:18,360 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3.i [2025-03-19 23:47:18,378 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/64f422153/2a4e4bf379914781a764c2b84b211e66/FLAGd09bccdd9 [2025-03-19 23:47:19,317 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/64f422153/2a4e4bf379914781a764c2b84b211e66 [2025-03-19 23:47:19,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 23:47:19,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 23:47:19,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 23:47:19,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 23:47:19,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 23:47:19,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0f0847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19, skipping insertion in model container [2025-03-19 23:47:19,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 23:47:19,657 WARN L250 ndardFunctionHandler]: 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-03-19 23:47:19,672 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:19,672 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:19,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 23:47:19,684 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 23:47:19,753 WARN L250 ndardFunctionHandler]: 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-03-19 23:47:19,764 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:19,766 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-19 23:47:19,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 23:47:19,828 INFO L204 MainTranslator]: Completed translation [2025-03-19 23:47:19,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19 WrapperNode [2025-03-19 23:47:19,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 23:47:19,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 23:47:19,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 23:47:19,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 23:47:19,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,866 INFO L138 Inliner]: procedures = 376, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2025-03-19 23:47:19,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 23:47:19,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 23:47:19,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 23:47:19,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 23:47:19,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 23:47:19,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 23:47:19,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 23:47:19,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 23:47:19,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (1/1) ... [2025-03-19 23:47:19,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 23:47:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:19,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 23:47:19,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 23:47:19,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-03-19 23:47:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-03-19 23:47:19,935 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-19 23:47:19,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 23:47:19,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 23:47:19,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 23:47:19,936 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 23:47:20,041 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 23:47:20,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 23:47:20,284 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 23:47:20,284 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 23:47:20,452 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 23:47:20,452 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 23:47:20,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:47:20 BoogieIcfgContainer [2025-03-19 23:47:20,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 23:47:20,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 23:47:20,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 23:47:20,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 23:47:20,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 11:47:19" (1/3) ... [2025-03-19 23:47:20,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5267ccb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:47:20, skipping insertion in model container [2025-03-19 23:47:20,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 11:47:19" (2/3) ... [2025-03-19 23:47:20,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5267ccb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 11:47:20, skipping insertion in model container [2025-03-19 23:47:20,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:47:20" (3/3) ... [2025-03-19 23:47:20,461 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-03-19 23:47:20,470 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 23:47:20,471 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-03-19 23:47:20,472 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 23:47:20,513 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-19 23:47:20,544 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 23:47:20,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:20,548 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-03-19 23:47:20,549 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-03-19 23:47:20,612 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 23:47:20,623 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 23:47:20,628 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;@7a43fe79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:20,628 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-19 23:47:20,907 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-19 23:47:20,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2055467201, now seen corresponding path program 1 times [2025-03-19 23:47:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051388510] [2025-03-19 23:47:20,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:20,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:20,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:20,921 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-03-19 23:47:20,922 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-03-19 23:47:20,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-19 23:47:21,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-19 23:47:21,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:21,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:21,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 23:47:21,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-19 23:47:21,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-19 23:47:21,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:21,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:21,103 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-19 23:47:21,105 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 23:47:21,106 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-03-19 23:47:21,107 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-03-19 23:47:21,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-19 23:47:21,308 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:21,312 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-19 23:47:21,313 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-03-19 23:47:21,314 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-19 23:47:21,314 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-19 23:47:21,338 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-19 23:47:21,340 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:21,348 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 23:47:21,348 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-03-19 23:47:21,348 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;@7a43fe79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 23:47:21,348 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-19 23:47:22,004 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:22,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1256097172, now seen corresponding path program 1 times [2025-03-19 23:47:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:22,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780141906] [2025-03-19 23:47:22,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:22,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:22,009 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-03-19 23:47:22,010 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-03-19 23:47:22,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-19 23:47:22,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-19 23:47:22,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:22,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:22,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-19 23:47:22,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 23:47:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:22,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 23:47:22,134 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-19 23:47:22,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780141906] [2025-03-19 23:47:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780141906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-19 23:47:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439895055] [2025-03-19 23:47:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:22,137 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-19 23:47:22,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-19 23:47:22,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-19 23:47:22,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-19 23:47:22,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:22,150 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:22,151 INFO L481 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-03-19 23:47:22,151 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:23,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:23,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-19 23:47:23,358 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:23,358 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:23,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1933576989, now seen corresponding path program 1 times [2025-03-19 23:47:23,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:23,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583335515] [2025-03-19 23:47:23,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:23,361 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-03-19 23:47:23,362 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-03-19 23:47:23,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-19 23:47:23,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-19 23:47:23,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:23,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:23,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-19 23:47:23,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 23:47:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:23,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 23:47:23,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-19 23:47:23,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583335515] [2025-03-19 23:47:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583335515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:23,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:23,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-19 23:47:23,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300466852] [2025-03-19 23:47:23,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:23,583 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 23:47:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-19 23:47:23,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 23:47:23,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-19 23:47:23,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:23,585 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:23,585 INFO L481 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-03-19 23:47:23,586 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:23,586 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:24,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:24,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:24,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-19 23:47:24,807 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:24,807 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:24,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 379574079, now seen corresponding path program 2 times [2025-03-19 23:47:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028471883] [2025-03-19 23:47:24,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 23:47:24,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:24,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:24,809 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-03-19 23:47:24,810 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-03-19 23:47:24,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-19 23:47:24,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-19 23:47:24,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 23:47:24,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:24,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-19 23:47:24,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 23:47:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:24,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 23:47:24,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-19 23:47:24,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028471883] [2025-03-19 23:47:24,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028471883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:24,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:24,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-19 23:47:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399614332] [2025-03-19 23:47:24,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:24,985 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-19 23:47:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-19 23:47:24,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-19 23:47:24,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-19 23:47:24,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:24,986 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:24,986 INFO L481 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-03-19 23:47:24,986 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:24,986 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:24,986 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:25,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:25,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:25,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:25,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-19 23:47:25,441 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:25,441 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:25,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:25,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2054379463, now seen corresponding path program 1 times [2025-03-19 23:47:25,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:25,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694092254] [2025-03-19 23:47:25,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:25,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:25,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:25,445 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-03-19 23:47:25,447 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-03-19 23:47:25,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-19 23:47:25,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-19 23:47:25,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:25,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:25,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-19 23:47:25,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 23:47:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:25,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 23:47:25,652 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-19 23:47:25,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694092254] [2025-03-19 23:47:25,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694092254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:25,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-19 23:47:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038979535] [2025-03-19 23:47:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:25,652 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-19 23:47:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-19 23:47:25,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-19 23:47:25,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-19 23:47:25,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:25,653 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:25,653 INFO L481 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-03-19 23:47:25,653 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:25,653 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:25,653 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:25,653 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:26,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:26,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:26,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:26,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 23:47:26,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-19 23:47:26,215 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:26,215 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:26,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 864789592, now seen corresponding path program 1 times [2025-03-19 23:47:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:26,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376406327] [2025-03-19 23:47:26,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:26,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:26,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:26,218 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-03-19 23:47:26,218 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-03-19 23:47:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-19 23:47:26,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-19 23:47:26,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:26,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 23:47:26,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-19 23:47:26,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 23:47:26,317 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-03-19 23:47:26,357 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-03-19 23:47:26,379 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-03-19 23:47:26,393 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-03-19 23:47:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 23:47:26,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-19 23:47:26,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-19 23:47:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376406327] [2025-03-19 23:47:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376406327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 23:47:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 23:47:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-19 23:47:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084561609] [2025-03-19 23:47:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 23:47:26,401 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-19 23:47:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-19 23:47:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-19 23:47:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-19 23:47:26,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:26,402 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 23:47:26,402 INFO L481 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-03-19 23:47:26,402 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:26,402 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:26,402 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:26,402 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-19 23:47:26,402 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 23:47:26,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-19 23:47:26,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:26,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-19 23:47:26,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-19 23:47:26,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 23:47:26,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-19 23:47:26,924 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:26,924 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-19 23:47:26,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 23:47:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash 781349406, now seen corresponding path program 1 times [2025-03-19 23:47:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-19 23:47:26,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968292328] [2025-03-19 23:47:26,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 23:47:26,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:26,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 23:47:26,927 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-03-19 23:47:26,927 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-03-19 23:47:26,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 23:47:27,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 23:47:27,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:27,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-19 23:47:27,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-19 23:47:27,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-19 23:47:27,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 23:47:27,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-19 23:47:27,175 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-19 23:47:27,175 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-19 23:47:27,175 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-19 23:47:27,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-19 23:47:27,375 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 23:47:27,376 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-19 23:47:27,376 INFO L320 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-03-19 23:47:27,456 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-19 23:47:27,456 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-03-19 23:47:27,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-03-19 23:47:27,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 11:47:27 BasicIcfg [2025-03-19 23:47:27,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-19 23:47:27,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-19 23:47:27,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-19 23:47:27,468 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-19 23:47:27,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 11:47:20" (3/4) ... [2025-03-19 23:47:27,469 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-19 23:47:27,470 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-19 23:47:27,471 INFO L158 Benchmark]: Toolchain (without parser) took 8150.26ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 88.5MB in the beginning and 95.6MB in the end (delta: -7.1MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2025-03-19 23:47:27,471 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 18.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 23:47:27,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.63ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 44.4MB in the end (delta: 43.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-19 23:47:27,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.36ms. Allocated memory is still 117.4MB. Free memory was 44.4MB in the beginning and 41.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-19 23:47:27,471 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 117.4MB. Free memory was 41.8MB in the beginning and 39.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-19 23:47:27,471 INFO L158 Benchmark]: RCFGBuilder took 563.06ms. Allocated memory is still 117.4MB. Free memory was 39.8MB in the beginning and 84.6MB in the end (delta: -44.8MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-19 23:47:27,471 INFO L158 Benchmark]: TraceAbstraction took 7011.52ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 84.6MB in the beginning and 97.3MB in the end (delta: -12.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2025-03-19 23:47:27,472 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 95.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-19 23:47:27,473 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.14ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 18.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.63ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 44.4MB in the end (delta: 43.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.36ms. Allocated memory is still 117.4MB. Free memory was 44.4MB in the beginning and 41.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 117.4MB. Free memory was 41.8MB in the beginning and 39.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 563.06ms. Allocated memory is still 117.4MB. Free memory was 39.8MB in the beginning and 84.6MB in the end (delta: -44.8MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7011.52ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 84.6MB in the beginning and 97.3MB in the end (delta: -12.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 176.2MB. Free memory was 97.3MB in the beginning and 95.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. 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: 241, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 138, dependent conditional: 0, dependent unconditional: 138, 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.3s, 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: 241, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 138, dependent conditional: 0, dependent unconditional: 138, 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: 1845, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 1206, dependent conditional: 0, dependent unconditional: 1206, 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: 2.1s, Number of persistent set computation: 2262, 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: 1845, independent: 638, independent conditional: 0, independent unconditional: 638, dependent: 1206, dependent conditional: 0, dependent unconditional: 1206, 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.7s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, 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: 6.0s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 3.6s, 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.5s 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-03-19 23:47:27,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample