./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/triangular-2.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 02:08:48,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 02:08:48,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 02:08:48,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 02:08:48,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 02:08:48,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 02:08:48,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 02:08:48,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 02:08:48,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 02:08:48,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 02:08:48,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 02:08:48,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 02:08:48,832 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 02:08:48,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 02:08:48,833 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 02:08:48,834 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:08:48,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 02:08:48,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:08:48,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 02:08:48,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 02:08:48,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 02:08:48,836 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 02:08:48,836 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 02:08:48,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 02:08:49,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 02:08:49,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 02:08:49,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 02:08:49,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 02:08:49,087 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 02:08:49,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/triangular-2.i [2025-04-25 02:08:50,403 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cae792d0c/ba2eadb13f5f45adbb50a9d50c8eb570/FLAG5a9426f4c [2025-04-25 02:08:50,626 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 02:08:50,626 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2025-04-25 02:08:50,636 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cae792d0c/ba2eadb13f5f45adbb50a9d50c8eb570/FLAG5a9426f4c [2025-04-25 02:08:51,556 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/cae792d0c/ba2eadb13f5f45adbb50a9d50c8eb570 [2025-04-25 02:08:51,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 02:08:51,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 02:08:51,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 02:08:51,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 02:08:51,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 02:08:51,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713bf53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51, skipping insertion in model container [2025-04-25 02:08:51,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 02:08:51,825 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2025-04-25 02:08:51,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:08:51,834 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 02:08:51,870 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i[30952,30965] [2025-04-25 02:08:51,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:08:51,894 INFO L204 MainTranslator]: Completed translation [2025-04-25 02:08:51,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51 WrapperNode [2025-04-25 02:08:51,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 02:08:51,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 02:08:51,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 02:08:51,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 02:08:51,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,919 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-25 02:08:51,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 02:08:51,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 02:08:51,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 02:08:51,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 02:08:51,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 02:08:51,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 02:08:51,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 02:08:51,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 02:08:51,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (1/1) ... [2025-04-25 02:08:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:08:51,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:08:51,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 02:08:51,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 02:08:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-25 02:08:51,989 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-25 02:08:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-25 02:08:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-25 02:08:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-25 02:08:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 02:08:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 02:08:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-25 02:08:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 02:08:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 02:08:51,991 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 02:08:52,084 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 02:08:52,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 02:08:52,169 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 02:08:52,169 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 02:08:52,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 02:08:52,216 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 02:08:52,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:08:52 BoogieIcfgContainer [2025-04-25 02:08:52,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 02:08:52,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 02:08:52,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 02:08:52,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 02:08:52,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 02:08:51" (1/3) ... [2025-04-25 02:08:52,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671e9dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:08:52, skipping insertion in model container [2025-04-25 02:08:52,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:08:51" (2/3) ... [2025-04-25 02:08:52,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671e9dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:08:52, skipping insertion in model container [2025-04-25 02:08:52,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:08:52" (3/3) ... [2025-04-25 02:08:52,223 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2025-04-25 02:08:52,232 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 02:08:52,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-2.i that has 3 procedures, 22 locations, 22 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-25 02:08:52,234 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 02:08:52,273 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-25 02:08:52,305 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:08:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 02:08:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:08:52,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 02:08:52,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 02:08:52,364 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:08:52,370 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:08:52,378 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@558d187f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:08:52,378 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-25 02:08:52,409 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:08:52,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:08:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1723095735, now seen corresponding path program 1 times [2025-04-25 02:08:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:08:52,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931305284] [2025-04-25 02:08:52,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:08:52,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:08:52,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-25 02:08:52,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-25 02:08:52,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:08:52,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:08:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:08:52,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931305284] [2025-04-25 02:08:52,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931305284] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:08:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:08:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:08:52,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755488393] [2025-04-25 02:08:52,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:08:52,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:08:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:08:52,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:08:52,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:08:52,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:08:52,768 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:08:52,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:08:52,769 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:08:52,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:08:52,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 02:08:52,869 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:08:52,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:08:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 338944428, now seen corresponding path program 1 times [2025-04-25 02:08:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:08:52,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104234330] [2025-04-25 02:08:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:08:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:08:52,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-25 02:08:52,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-25 02:08:52,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:08:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:08:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:08:53,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104234330] [2025-04-25 02:08:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104234330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:08:53,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137375601] [2025-04-25 02:08:53,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:08:53,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:08:53,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:08:53,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:08:53,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 02:08:53,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-25 02:08:53,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-25 02:08:53,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:08:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:08:53,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-25 02:08:53,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:08:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:53,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:08:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137375601] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:08:53,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:08:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-25 02:08:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161354622] [2025-04-25 02:08:53,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:08:53,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-25 02:08:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:08:53,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-25 02:08:53,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-25 02:08:53,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:08:53,456 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:08:53,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:08:53,456 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:08:53,456 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:08:53,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:08:53,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 02:08:53,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-25 02:08:53,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-25 02:08:53,905 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:08:53,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:08:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2099365810, now seen corresponding path program 2 times [2025-04-25 02:08:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:08:53,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886373479] [2025-04-25 02:08:53,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:08:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:08:53,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-25 02:08:53,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 02:08:53,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:08:53,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:08:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:08:54,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886373479] [2025-04-25 02:08:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886373479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:08:54,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277124002] [2025-04-25 02:08:54,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:08:54,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:08:54,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:08:54,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:08:54,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 02:08:54,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-25 02:08:54,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 02:08:54,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:08:54,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:08:54,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-25 02:08:54,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:08:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:54,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:08:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:08:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277124002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:08:54,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:08:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-04-25 02:08:54,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641686832] [2025-04-25 02:08:54,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:08:54,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-25 02:08:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:08:54,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-25 02:08:54,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-04-25 02:08:54,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:08:54,508 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:08:54,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:08:54,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:08:54,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2025-04-25 02:08:54,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:08:54,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:08:54,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 02:08:54,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-25 02:08:54,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 02:08:55,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:08:55,081 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:08:55,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:08:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 964220088, now seen corresponding path program 3 times [2025-04-25 02:08:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:08:55,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348108101] [2025-04-25 02:08:55,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:08:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:08:55,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-04-25 02:08:55,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 41 of 41 statements. [2025-04-25 02:08:55,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-25 02:08:55,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:08:55,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:08:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-25 02:08:55,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-25 02:08:55,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:08:55,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:08:55,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:08:55,130 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:08:55,131 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-25 02:08:55,132 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-25 02:08:55,132 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-25 02:08:55,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 02:08:55,136 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-04-25 02:08:55,207 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 02:08:55,207 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 02:08:55,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 02:08:55,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 02:08:55 BasicIcfg [2025-04-25 02:08:55,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 02:08:55,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 02:08:55,219 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 02:08:55,219 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 02:08:55,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:08:52" (3/4) ... [2025-04-25 02:08:55,220 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-25 02:08:55,273 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-04-25 02:08:55,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-25 02:08:55,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-25 02:08:55,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 02:08:55,307 INFO L158 Benchmark]: Toolchain (without parser) took 3748.87ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 81.7MB in the end (delta: 40.5MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-04-25 02:08:55,307 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:08:55,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.42ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 100.9MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-25 02:08:55,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.47ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 98.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:08:55,308 INFO L158 Benchmark]: Boogie Preprocessor took 22.67ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 97.8MB in the end (delta: 746.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:08:55,308 INFO L158 Benchmark]: RCFGBuilder took 273.41ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 80.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-25 02:08:55,308 INFO L158 Benchmark]: TraceAbstraction took 3000.51ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 93.5MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:08:55,308 INFO L158 Benchmark]: Witness Printer took 87.77ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 81.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-25 02:08:55,309 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.42ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 100.9MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.47ms. Allocated memory is still 167.8MB. Free memory was 100.9MB in the beginning and 98.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.67ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 97.8MB in the end (delta: 746.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 273.41ms. Allocated memory is still 167.8MB. Free memory was 97.8MB in the beginning and 80.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3000.51ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 93.5MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.77ms. Allocated memory is still 167.8MB. Free memory was 93.5MB in the beginning and 81.7MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 217, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 203, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 217, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 203, unknown conditional: 0, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 18, Number of trivial persistent sets: 5, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 217, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 203, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 203, independent: 196, independent conditional: 0, independent unconditional: 196, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 217, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 203, unknown conditional: 0, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 197, Positive conditional cache size: 0, Positive unconditional cache size: 197, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, argc=51, i=3, id1=-2, j=6] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, argc=51, i=3, id1=-2, id2=-1, j=6] [L696] 1 int k = 0; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L716] 0 int condI = i >= (2*5 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, argc=51, condI=0, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L704] COND TRUE 2 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 5 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L719] 0 int condJ = j >= (2*5 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-2, id2=-1, j=16, k=5, k=5] [L721] COND TRUE 0 condI || condJ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-2, id2=-1, j=16, k=5, k=5] [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:50}, \at(argc, Pre)=51, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=15, id1=-2, id2=-1, j=16, k=5, k=5] - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 34 locations, 36 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.7s, 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: 46, 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.2s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 952 SizeOfPredicates, 12 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/66 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 proved your program to be incorrect! [2025-04-25 02:08:55,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE