./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/twostage_3.i --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/twostage_3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 00:34:37,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 00:34:37,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 00:34:37,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 00:34:37,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 00:34:37,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 00:34:37,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 00:34:37,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 00:34:37,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 00:34:37,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 00:34:37,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 00:34:37,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 00:34:37,695 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 00:34:37,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 00:34:37,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 00:34:37,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 00:34:37,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 00:34:37,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 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 [2025-01-23 00:34:37,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 00:34:37,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 00:34:37,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 00:34:37,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 00:34:37,976 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 00:34:37,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/twostage_3.i [2025-01-23 00:34:39,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b664db277/d4def14ffff94d35816fd3734dd3a89f/FLAG6cb15a8b7 [2025-01-23 00:34:39,470 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 00:34:39,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/twostage_3.i [2025-01-23 00:34:39,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b664db277/d4def14ffff94d35816fd3734dd3a89f/FLAG6cb15a8b7 [2025-01-23 00:34:39,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/b664db277/d4def14ffff94d35816fd3734dd3a89f [2025-01-23 00:34:39,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 00:34:39,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 00:34:39,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 00:34:39,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 00:34:39,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 00:34:39,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:34:39" (1/1) ... [2025-01-23 00:34:39,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730d9696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:39, skipping insertion in model container [2025-01-23 00:34:39,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:34:39" (1/1) ... [2025-01-23 00:34:39,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 00:34:40,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2025-01-23 00:34:40,084 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:34:40,084 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:34:40,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 00:34:40,091 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 00:34:40,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2025-01-23 00:34:40,189 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:34:40,189 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:34:40,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 00:34:40,272 INFO L204 MainTranslator]: Completed translation [2025-01-23 00:34:40,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40 WrapperNode [2025-01-23 00:34:40,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 00:34:40,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 00:34:40,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 00:34:40,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 00:34:40,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,316 INFO L138 Inliner]: procedures = 373, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2025-01-23 00:34:40,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 00:34:40,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 00:34:40,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 00:34:40,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 00:34:40,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 00:34:40,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 00:34:40,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 00:34:40,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 00:34:40,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (1/1) ... [2025-01-23 00:34:40,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 00:34:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:34:40,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 00:34:40,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-01-23 00:34:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-01-23 00:34:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 00:34:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 00:34:40,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 00:34:40,401 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 00:34:40,528 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 00:34:40,530 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 00:34:40,783 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 00:34:40,784 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 00:34:40,944 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 00:34:40,945 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 00:34:40,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:34:40 BoogieIcfgContainer [2025-01-23 00:34:40,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 00:34:40,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 00:34:40,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 00:34:40,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 00:34:40,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 12:34:39" (1/3) ... [2025-01-23 00:34:40,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4495d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:34:40, skipping insertion in model container [2025-01-23 00:34:40,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:34:40" (2/3) ... [2025-01-23 00:34:40,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4495d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:34:40, skipping insertion in model container [2025-01-23 00:34:40,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:34:40" (3/3) ... [2025-01-23 00:34:40,953 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-01-23 00:34:40,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 00:34:40,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-23 00:34:40,965 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 00:34:41,001 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-23 00:34:41,035 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:34:41,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 00:34:41,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:34:41,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 00:34:41,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 00:34:41,112 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 00:34:41,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 00:34:41,131 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ec4081f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:34:41,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 00:34:41,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 00:34:41,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1847419089, now seen corresponding path program 1 times [2025-01-23 00:34:41,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:41,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825940856] [2025-01-23 00:34:41,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:34:41,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 00:34:41,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 00:34:41,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:41,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:34:41,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 00:34:41,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 00:34:41,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 00:34:41,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:41,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:34:41,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 00:34:41,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 00:34:41,526 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 00:34:41,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-23 00:34:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 00:34:41,537 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 00:34:41,539 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-01-23 00:34:41,541 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 00:34:41,541 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 00:34:41,574 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-23 00:34:41,579 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:34:41,591 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 00:34:41,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-01-23 00:34:41,592 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ec4081f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:34:41,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 00:34:42,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:42,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 164239484, now seen corresponding path program 1 times [2025-01-23 00:34:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855297816] [2025-01-23 00:34:42,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:34:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:42,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-23 00:34:42,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-23 00:34:42,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:42,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855297816] [2025-01-23 00:34:42,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855297816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:42,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:42,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 00:34:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348792845] [2025-01-23 00:34:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 00:34:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:42,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 00:34:42,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 00:34:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:42,213 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:42,215 INFO L472 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-01-23 00:34:42,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:43,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 00:34:43,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:43,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1735076406, now seen corresponding path program 1 times [2025-01-23 00:34:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094075389] [2025-01-23 00:34:43,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:34:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:43,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-23 00:34:43,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 00:34:43,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:43,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:43,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:43,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094075389] [2025-01-23 00:34:43,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094075389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:43,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:43,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:34:43,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10844819] [2025-01-23 00:34:43,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:34:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:43,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:34:43,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:34:43,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:43,601 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:43,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:34:43,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:43,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 00:34:44,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash -843293123, now seen corresponding path program 1 times [2025-01-23 00:34:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815459171] [2025-01-23 00:34:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:34:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:44,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-23 00:34:44,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-23 00:34:44,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:44,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:44,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815459171] [2025-01-23 00:34:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815459171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:44,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:34:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66553091] [2025-01-23 00:34:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:34:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:44,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:34:44,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:34:44,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:44,839 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:44,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:34:44,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:44,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:44,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:45,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 00:34:45,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:45,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1384462749, now seen corresponding path program 2 times [2025-01-23 00:34:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405666562] [2025-01-23 00:34:45,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 00:34:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:45,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-01-23 00:34:45,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-23 00:34:45,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 00:34:45,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:46,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:46,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405666562] [2025-01-23 00:34:46,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405666562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:46,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:34:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149965376] [2025-01-23 00:34:46,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:34:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:46,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:34:46,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:34:46,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:46,041 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:46,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:34:46,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:46,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:46,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:46,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:47,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 00:34:47,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:47,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1699343691, now seen corresponding path program 3 times [2025-01-23 00:34:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:47,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524496669] [2025-01-23 00:34:47,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 00:34:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:47,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-01-23 00:34:47,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-23 00:34:47,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 00:34:47,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524496669] [2025-01-23 00:34:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524496669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:47,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:34:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809662032] [2025-01-23 00:34:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:47,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:34:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:47,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:34:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:34:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:47,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:47,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:34:47,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:47,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:47,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:47,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:47,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:52,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 00:34:52,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1357286204, now seen corresponding path program 2 times [2025-01-23 00:34:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036515753] [2025-01-23 00:34:52,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 00:34:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:52,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-01-23 00:34:52,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 00:34:52,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 00:34:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:52,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036515753] [2025-01-23 00:34:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036515753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:52,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 00:34:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884668107] [2025-01-23 00:34:52,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:52,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 00:34:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:52,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 00:34:52,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-23 00:34:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:52,892 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:34:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:52,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:55,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 00:34:55,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:55,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -280526180, now seen corresponding path program 1 times [2025-01-23 00:34:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574721578] [2025-01-23 00:34:55,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:34:55,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:55,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:34:55,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:34:55,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:55,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:55,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574721578] [2025-01-23 00:34:55,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574721578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:55,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 00:34:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131168361] [2025-01-23 00:34:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:55,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:34:55,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:55,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:34:55,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:34:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:55,316 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:55,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:34:55,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:55,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:55,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:55,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:55,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:55,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:55,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 00:34:56,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 00:34:56,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:56,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:56,837 INFO L85 PathProgramCache]: Analyzing trace with hash 129113862, now seen corresponding path program 2 times [2025-01-23 00:34:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795055321] [2025-01-23 00:34:56,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 00:34:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:56,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:34:56,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:34:56,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 00:34:56,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:34:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:34:57,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 00:34:57,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795055321] [2025-01-23 00:34:57,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795055321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:34:57,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:34:57,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:34:57,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487427801] [2025-01-23 00:34:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:34:57,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:34:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 00:34:57,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:34:57,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:34:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:57,059 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:34:57,060 INFO L472 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-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 00:34:57,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:34:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:34:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:34:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:34:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 00:34:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:34:58,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 00:34:58,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:34:58,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:34:58,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1504229498, now seen corresponding path program 3 times [2025-01-23 00:34:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 00:34:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3067363] [2025-01-23 00:34:58,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 00:34:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 00:34:58,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:34:58,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:34:58,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 00:34:58,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:34:58,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 00:34:58,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:34:58,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:34:58,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:34:58,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:34:58,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 00:34:58,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 00:34:58,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 00:34:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-23 00:34:58,569 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1] [2025-01-23 00:34:58,569 INFO L319 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-01-23 00:34:58,655 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-01-23 00:34:58,655 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 00:34:58,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-23 00:34:58,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 12:34:58 BasicIcfg [2025-01-23 00:34:58,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 00:34:58,665 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 00:34:58,665 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 00:34:58,665 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 00:34:58,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:34:40" (3/4) ... [2025-01-23 00:34:58,667 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-23 00:34:58,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 00:34:58,668 INFO L158 Benchmark]: Toolchain (without parser) took 18918.18ms. Allocated memory was 83.9MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 56.8MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 329.9MB. Max. memory is 16.1GB. [2025-01-23 00:34:58,669 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 00:34:58,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.26ms. Allocated memory is still 83.9MB. Free memory was 56.5MB in the beginning and 52.1MB in the end (delta: 4.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-01-23 00:34:58,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.88ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 49.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 00:34:58,669 INFO L158 Benchmark]: Boogie Preprocessor took 16.58ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 48.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-23 00:34:58,670 INFO L158 Benchmark]: RCFGBuilder took 608.12ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 50.9MB in the end (delta: -2.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2025-01-23 00:34:58,670 INFO L158 Benchmark]: TraceAbstraction took 17717.76ms. Allocated memory was 83.9MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 50.5MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 319.5MB. Max. memory is 16.1GB. [2025-01-23 00:34:58,670 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 3.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 62.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 00:34:58,671 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.18ms. Allocated memory is still 83.9MB. Free memory was 61.6MB in the beginning and 61.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.26ms. Allocated memory is still 83.9MB. Free memory was 56.5MB in the beginning and 52.1MB in the end (delta: 4.4MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.88ms. Allocated memory is still 83.9MB. Free memory was 52.1MB in the beginning and 49.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.58ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 48.0MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 608.12ms. Allocated memory is still 83.9MB. Free memory was 48.0MB in the beginning and 50.9MB in the end (delta: -2.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 17717.76ms. Allocated memory was 83.9MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 50.5MB in the beginning and 2.7GB in the end (delta: -2.7GB). Peak memory consumption was 319.5MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 3.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 62.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 14, Number of trivial persistent sets: 14, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 147, independent: 114, independent conditional: 0, independent unconditional: 114, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1473261, independent: 1366840, independent conditional: 1361272, independent unconditional: 5568, dependent: 106421, dependent conditional: 106234, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1379309, independent: 1366840, independent conditional: 0, independent unconditional: 1366840, dependent: 12469, dependent conditional: 0, dependent unconditional: 12469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5380, independent: 5191, independent conditional: 0, independent unconditional: 5191, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5380, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2619, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 1661, dependent conditional: 0, dependent unconditional: 1661, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1379309, independent: 1361649, independent conditional: 0, independent unconditional: 1361649, dependent: 12280, dependent conditional: 0, dependent unconditional: 12280, unknown: 5380, unknown conditional: 0, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5635, Positive cache size: 5443, Positive conditional cache size: 0, Positive unconditional cache size: 5443, Negative cache size: 192, Negative conditional cache size: 0, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 93952, Persistent sets #1 benchmarks: Persistent set computation time: 4.2s, Number of persistent set computation: 47392, Number of trivial persistent sets: 38283, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1473261, independent: 1366840, independent conditional: 1361272, independent unconditional: 5568, dependent: 106421, dependent conditional: 106234, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1379309, independent: 1366840, independent conditional: 0, independent unconditional: 1366840, dependent: 12469, dependent conditional: 0, dependent unconditional: 12469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5380, independent: 5191, independent conditional: 0, independent unconditional: 5191, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5380, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2619, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 1661, dependent conditional: 0, dependent unconditional: 1661, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1379309, independent: 1361649, independent conditional: 0, independent unconditional: 1361649, dependent: 12280, dependent conditional: 0, dependent unconditional: 12280, unknown: 5380, unknown conditional: 0, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5635, Positive cache size: 5443, Positive conditional cache size: 0, Positive unconditional cache size: 5443, Negative cache size: 192, Negative conditional cache size: 0, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 93952 - 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}] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=0, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=1] [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=1, data2Lock={-1:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, 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=1, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, 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=1, data2Lock={-1:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={6:0}, t1=1, tPool={5:0}] [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=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] 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=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}] [L1309] COND TRUE 0 i < iRThreads [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] [L1253] 1 data2Value = t1 + 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, \result={0:0}, data1Lock={-2:0}, data1Value=1, data2Lock={-1:0}, data2Value=2, 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, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, 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, 5 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 15.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 56, 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, 1.4s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-01-23 00:34:58,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread/twostage_3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1032ef3fe166161226ca7e81ea27802cfc3f516ad1e4b45c387461fe1ddeccf8 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 00:35:00,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 00:35:00,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-01-23 00:35:00,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 00:35:00,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 00:35:00,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 00:35:00,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 00:35:00,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 00:35:00,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 00:35:00,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 00:35:00,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 00:35:00,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 00:35:00,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 00:35:00,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 00:35:00,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 00:35:00,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 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 [2025-01-23 00:35:01,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 00:35:01,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 00:35:01,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 00:35:01,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 00:35:01,114 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 00:35:01,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/twostage_3.i [2025-01-23 00:35:02,265 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/beb63848e/dd73c9b638734a9a95c99ec2ee4d80ba/FLAG2111cb89d [2025-01-23 00:35:02,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 00:35:02,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/twostage_3.i [2025-01-23 00:35:02,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/beb63848e/dd73c9b638734a9a95c99ec2ee4d80ba/FLAG2111cb89d [2025-01-23 00:35:02,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/beb63848e/dd73c9b638734a9a95c99ec2ee4d80ba [2025-01-23 00:35:02,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 00:35:02,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 00:35:02,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 00:35:02,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 00:35:02,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 00:35:02,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:35:02" (1/1) ... [2025-01-23 00:35:02,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5914ac6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:02, skipping insertion in model container [2025-01-23 00:35:02,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 12:35:02" (1/1) ... [2025-01-23 00:35:02,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 00:35:03,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2025-01-23 00:35:03,191 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:35:03,192 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:35:03,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 00:35:03,203 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 00:35:03,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/twostage_3.i[59093,59106] [2025-01-23 00:35:03,325 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:35:03,327 WARN L1731 CHandler]: Possible shadowing of function lock [2025-01-23 00:35:03,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 00:35:03,385 INFO L204 MainTranslator]: Completed translation [2025-01-23 00:35:03,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03 WrapperNode [2025-01-23 00:35:03,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 00:35:03,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 00:35:03,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 00:35:03,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 00:35:03,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,433 INFO L138 Inliner]: procedures = 376, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2025-01-23 00:35:03,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 00:35:03,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 00:35:03,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 00:35:03,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 00:35:03,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 00:35:03,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 00:35:03,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 00:35:03,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 00:35:03,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (1/1) ... [2025-01-23 00:35:03,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 00:35:03,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:03,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 00:35:03,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 00:35:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-01-23 00:35:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-01-23 00:35:03,521 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-01-23 00:35:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-01-23 00:35:03,521 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 00:35:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 00:35:03,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 00:35:03,523 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 00:35:03,636 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 00:35:03,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 00:35:03,888 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 00:35:03,890 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 00:35:04,079 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 00:35:04,080 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 00:35:04,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:35:04 BoogieIcfgContainer [2025-01-23 00:35:04,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 00:35:04,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 00:35:04,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 00:35:04,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 00:35:04,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 12:35:02" (1/3) ... [2025-01-23 00:35:04,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4953292f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:35:04, skipping insertion in model container [2025-01-23 00:35:04,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 12:35:03" (2/3) ... [2025-01-23 00:35:04,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4953292f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 12:35:04, skipping insertion in model container [2025-01-23 00:35:04,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:35:04" (3/3) ... [2025-01-23 00:35:04,088 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2025-01-23 00:35:04,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 00:35:04,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3.i that has 3 procedures, 46 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-23 00:35:04,099 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 00:35:04,136 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-23 00:35:04,164 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:35:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 00:35:04,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:04,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 00:35:04,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 00:35:04,232 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 00:35:04,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 00:35:04,245 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3366edc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:35:04,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 00:35:04,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 00:35:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1174253329, now seen corresponding path program 1 times [2025-01-23 00:35:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:04,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757275991] [2025-01-23 00:35:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:35:04,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:04,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:04,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-23 00:35:04,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 00:35:04,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 00:35:04,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:04,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:35:04,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 00:35:04,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-23 00:35:04,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-23 00:35:04,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:04,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:35:04,606 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-23 00:35:04,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 00:35:04,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 00:35:04,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-23 00:35:04,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-23 00:35:04,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:04,817 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-23 00:35:04,819 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/2) [2025-01-23 00:35:04,820 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-23 00:35:04,820 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-23 00:35:04,854 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-23 00:35:04,858 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:35:04,868 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 00:35:04,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == funcBThread2of2ForFork0 ======== [2025-01-23 00:35:04,870 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3366edc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 00:35:04,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 00:35:05,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash 386463036, now seen corresponding path program 1 times [2025-01-23 00:35:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827209507] [2025-01-23 00:35:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:35:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:05,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:05,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:05,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-23 00:35:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-23 00:35:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-23 00:35:05,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:05,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:05,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-23 00:35:05,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:05,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:05,607 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827209507] [2025-01-23 00:35:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827209507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 00:35:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741177314] [2025-01-23 00:35:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:05,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 00:35:05,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:05,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 00:35:05,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 00:35:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:05,622 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:05,623 INFO L472 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-01-23 00:35:05,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:06,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:06,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-23 00:35:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:06,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:06,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1127717834, now seen corresponding path program 1 times [2025-01-23 00:35:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754906160] [2025-01-23 00:35:06,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:35:06,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:06,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:06,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-23 00:35:06,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-23 00:35:07,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 00:35:07,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 00:35:07,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:07,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:07,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754906160] [2025-01-23 00:35:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754906160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:07,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:35:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898797995] [2025-01-23 00:35:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:07,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:35:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:07,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:35:07,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:35:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:07,177 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:07,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:35:07,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:07,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:08,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-23 00:35:08,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:08,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1502915011, now seen corresponding path program 1 times [2025-01-23 00:35:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:08,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848444060] [2025-01-23 00:35:08,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:35:08,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:08,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:08,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-23 00:35:08,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-23 00:35:08,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-23 00:35:08,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:08,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:08,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 00:35:08,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:08,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:08,814 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848444060] [2025-01-23 00:35:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848444060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:08,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:35:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690487067] [2025-01-23 00:35:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:35:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:35:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:35:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:08,815 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:08,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:35:08,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:08,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:08,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:09,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-23 00:35:09,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:09,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 724840861, now seen corresponding path program 2 times [2025-01-23 00:35:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [659655788] [2025-01-23 00:35:09,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 00:35:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:09,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:09,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-23 00:35:10,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 1 equivalence classes. [2025-01-23 00:35:10,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-23 00:35:10,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 00:35:10,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:10,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 00:35:10,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:10,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:10,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:10,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659655788] [2025-01-23 00:35:10,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659655788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:10,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:10,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:35:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475496490] [2025-01-23 00:35:10,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:10,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:35:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:10,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:35:10,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:35:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:10,292 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:10,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:35:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:10,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:11,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-23 00:35:11,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:11,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:11,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1936001717, now seen corresponding path program 3 times [2025-01-23 00:35:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816633731] [2025-01-23 00:35:11,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 00:35:11,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:11,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-23 00:35:12,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 64 statements into 1 equivalence classes. [2025-01-23 00:35:12,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-23 00:35:12,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 00:35:12,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:12,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 00:35:12,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:12,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:12,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816633731] [2025-01-23 00:35:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816633731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:35:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867115468] [2025-01-23 00:35:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:35:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:12,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:35:12,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:35:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:12,203 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:12,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:35:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:12,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:16,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-23 00:35:17,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:17,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:17,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1505508036, now seen corresponding path program 2 times [2025-01-23 00:35:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857670419] [2025-01-23 00:35:17,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 00:35:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:17,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:17,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-23 00:35:17,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-01-23 00:35:17,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-23 00:35:17,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 00:35:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:17,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-23 00:35:17,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:17,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:17,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857670419] [2025-01-23 00:35:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857670419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 00:35:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119311778] [2025-01-23 00:35:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 00:35:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:17,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 00:35:17,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-23 00:35:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:17,349 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:17,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:35:17,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:17,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:17,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:17,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:17,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:17,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:19,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-23 00:35:19,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:19,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:19,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1204158374, now seen corresponding path program 1 times [2025-01-23 00:35:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:19,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879537206] [2025-01-23 00:35:19,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 00:35:19,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:19,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:19,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:19,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-23 00:35:19,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:35:19,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:35:19,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:19,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:19,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-23 00:35:19,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:19,874 INFO L378 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-01-23 00:35:19,897 INFO L378 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-01-23 00:35:19,934 INFO L378 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-01-23 00:35:19,950 INFO L378 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-01-23 00:35:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:19,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:19,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879537206] [2025-01-23 00:35:19,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879537206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:19,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:19,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 00:35:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216459550] [2025-01-23 00:35:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:19,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 00:35:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:19,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 00:35:19,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-23 00:35:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:19,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:19,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 00:35:19,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:19,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 00:35:21,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-23 00:35:21,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:21,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -794518332, now seen corresponding path program 2 times [2025-01-23 00:35:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266802507] [2025-01-23 00:35:21,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 00:35:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:21,698 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:21,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-23 00:35:21,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:35:21,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:35:21,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 00:35:21,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 00:35:21,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-23 00:35:21,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 00:35:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 00:35:21,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 00:35:21,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-23 00:35:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266802507] [2025-01-23 00:35:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266802507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 00:35:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 00:35:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 00:35:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23249375] [2025-01-23 00:35:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 00:35:21,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 00:35:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-23 00:35:21,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 00:35:21,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-23 00:35:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:21,919 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 00:35:21,919 INFO L472 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-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 00:35:21,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 00:35:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 00:35:23,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-23 00:35:23,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-23 00:35:23,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:23,467 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting funcBErr0ASSERT_VIOLATIONERROR_FUNCTION === [funcBErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 00:35:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 00:35:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1867105604, now seen corresponding path program 3 times [2025-01-23 00:35:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-23 00:35:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602047772] [2025-01-23 00:35:23,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 00:35:23,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:23,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 00:35:23,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 00:35:23,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-23 00:35:23,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:35:23,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:35:23,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 00:35:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:35:23,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 00:35:23,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 00:35:23,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 00:35:23,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 00:35:23,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 00:35:23,728 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-23 00:35:23,729 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 00:35:23,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location funcBErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 00:35:23,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-23 00:35:23,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 00:35:23,931 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1] [2025-01-23 00:35:23,931 INFO L319 ceAbstractionStarter]: Result for error location funcBThread2of2ForFork0 was UNSAFE (1/3) [2025-01-23 00:35:24,007 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-01-23 00:35:24,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 00:35:24,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-23 00:35:24,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 12:35:24 BasicIcfg [2025-01-23 00:35:24,024 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 00:35:24,024 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 00:35:24,024 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 00:35:24,024 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 00:35:24,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 12:35:04" (3/4) ... [2025-01-23 00:35:24,026 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-23 00:35:24,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 00:35:24,028 INFO L158 Benchmark]: Toolchain (without parser) took 21185.58ms. Allocated memory was 109.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 81.4MB in the beginning and 606.6MB in the end (delta: -525.2MB). Peak memory consumption was 879.9MB. Max. memory is 16.1GB. [2025-01-23 00:35:24,028 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 00:35:24,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.12ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 39.1MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-23 00:35:24,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.59ms. Allocated memory is still 109.1MB. Free memory was 39.1MB in the beginning and 82.1MB in the end (delta: -43.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2025-01-23 00:35:24,028 INFO L158 Benchmark]: Boogie Preprocessor took 33.02ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 00:35:24,028 INFO L158 Benchmark]: RCFGBuilder took 613.86ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 70.3MB in the end (delta: 9.7MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2025-01-23 00:35:24,028 INFO L158 Benchmark]: TraceAbstraction took 19941.05ms. Allocated memory was 109.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.0MB in the beginning and 606.6MB in the end (delta: -536.6MB). Peak memory consumption was 871.1MB. Max. memory is 16.1GB. [2025-01-23 00:35:24,029 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 1.5GB. Free memory was 606.6MB in the beginning and 606.6MB in the end (delta: 59.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 00:35:24,030 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.18ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.12ms. Allocated memory is still 109.1MB. Free memory was 81.4MB in the beginning and 39.1MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.59ms. Allocated memory is still 109.1MB. Free memory was 39.1MB in the beginning and 82.1MB in the end (delta: -43.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.02ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 613.86ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 70.3MB in the end (delta: 9.7MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19941.05ms. Allocated memory was 109.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 70.0MB in the beginning and 606.6MB in the end (delta: -536.6MB). Peak memory consumption was 871.1MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 1.5GB. Free memory was 606.6MB in the beginning and 606.6MB in the end (delta: 59.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 14, Number of trivial persistent sets: 14, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 265, independent: 260, independent conditional: 8, independent unconditional: 252, dependent: 5, dependent conditional: 2, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 255, independent: 252, independent conditional: 0, independent unconditional: 252, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 255, independent: 245, independent conditional: 0, independent unconditional: 245, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 263, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 255, unknown conditional: 0, unknown unconditional: 255] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1473261, independent: 1366840, independent conditional: 1361272, independent unconditional: 5568, dependent: 106421, dependent conditional: 106234, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1379309, independent: 1366840, independent conditional: 0, independent unconditional: 1366840, dependent: 12469, dependent conditional: 0, dependent unconditional: 12469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5380, independent: 5191, independent conditional: 0, independent unconditional: 5191, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5380, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3226, independent: 1320, independent conditional: 0, independent unconditional: 1320, dependent: 1906, dependent conditional: 0, dependent unconditional: 1906, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1379309, independent: 1361649, independent conditional: 0, independent unconditional: 1361649, dependent: 12280, dependent conditional: 0, dependent unconditional: 12280, unknown: 5380, unknown conditional: 0, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5635, Positive cache size: 5443, Positive conditional cache size: 0, Positive unconditional cache size: 5443, Negative cache size: 192, Negative conditional cache size: 0, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 93952, Persistent sets #1 benchmarks: Persistent set computation time: 4.6s, Number of persistent set computation: 47392, Number of trivial persistent sets: 38283, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1473261, independent: 1366840, independent conditional: 1361272, independent unconditional: 5568, dependent: 106421, dependent conditional: 106234, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1379309, independent: 1366840, independent conditional: 0, independent unconditional: 1366840, dependent: 12469, dependent conditional: 0, dependent unconditional: 12469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5380, independent: 5191, independent conditional: 0, independent unconditional: 5191, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5380, independent: 5048, independent conditional: 0, independent unconditional: 5048, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 332, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3226, independent: 1320, independent conditional: 0, independent unconditional: 1320, dependent: 1906, dependent conditional: 0, dependent unconditional: 1906, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1379309, independent: 1361649, independent conditional: 0, independent unconditional: 1361649, dependent: 12280, dependent conditional: 0, dependent unconditional: 12280, unknown: 5380, unknown conditional: 0, unknown unconditional: 5380] , Statistics on independence cache: Total cache size (in pairs): 5635, Positive cache size: 5443, Positive conditional cache size: 0, Positive unconditional cache size: 5443, Negative cache size: 192, Negative conditional cache size: 0, Negative unconditional cache size: 192, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 93952 - 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={3:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={134217735: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={3:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, rPool={134217735:0}, tPool={7:0}] [L1245] 1 int t1 = -1; VAL [\at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=0, data2Lock={3:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1247] 1 data1Value = 1 VAL [\at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={3:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=-1] [L1250] 1 t1 = data1Value VAL [\at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={3:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, t1=1] [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=1, data2Lock={3:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, rPool={134217735:0}, t1=1, 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=1, data2Lock={3:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={134217735:0}, t1=1, 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=1, data2Lock={3:0}, data2Value=0, err=0, i=0, iRThreads=2, iTThreads=1, param={0:0}, rPool={134217735:0}, t1=1, tPool={7:0}] [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=1, data2Lock={3: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={3: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={3: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={3:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=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=1, data2Lock={3:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={134217735:0}, t1=1, t1=1, t2=0, tPool={7:0}] [L1309] COND TRUE 0 i < iRThreads [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={3:0}, data2Value=0, err=0, i=1, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, rPool={134217735: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={3: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={3: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={3:0}, data2Value=0, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1253] 1 data2Value = t1 + 1 VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={3:0}, data2Value=2, iRThreads=2, iTThreads=1, param={0:0}, param={0:0}, t1=1, t1=1, t2=0] [L1255] 1 return ((void *)0); [L1270] COND TRUE 3 t2 != (t1 + 1) [L1272] 3 reach_error() VAL [\at(param, Pre)={0:0}, \at(param, Pre)={0:0}, \result={0:0}, data1Lock={4:0}, data1Value=1, data2Lock={3:0}, data2Value=2, 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, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, 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.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, 5 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 15.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: 54, 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.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1594 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-01-23 00:35:24,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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