./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 44c38e66 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/fib_unsafe-6.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 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b --- Real Ultimate output --- This is Ultimate 0.3.0-?-44c38e6-m [2025-04-24 18:27:08,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 18:27:08,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 18:27:08,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 18:27:08,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 18:27:08,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 18:27:08,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 18:27:08,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 18:27:08,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 18:27:08,182 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 18:27:08,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 18:27:08,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 18:27:08,183 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 18:27:08,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 18:27:08,184 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 18:27:08,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:27:08,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 18:27:08,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:27:08,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 18:27:08,186 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 18:27:08,186 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 -> 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b [2025-04-24 18:27:08,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 18:27:08,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 18:27:08,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 18:27:08,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 18:27:08,422 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 18:27:08,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/fib_unsafe-6.i [2025-04-24 18:27:09,720 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c71cad770/1f4f79b64a9843ec8d17a94dc9f5e0c7/FLAG098015804 [2025-04-24 18:27:09,965 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 18:27:09,965 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-6.i [2025-04-24 18:27:09,974 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c71cad770/1f4f79b64a9843ec8d17a94dc9f5e0c7/FLAG098015804 [2025-04-24 18:27:10,771 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c71cad770/1f4f79b64a9843ec8d17a94dc9f5e0c7 [2025-04-24 18:27:10,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 18:27:10,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 18:27:10,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 18:27:10,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 18:27:10,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 18:27:10,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:27:10" (1/1) ... [2025-04-24 18:27:10,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6860ffa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:10, skipping insertion in model container [2025-04-24 18:27:10,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 06:27:10" (1/1) ... [2025-04-24 18:27:10,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 18:27:11,033 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/fib_unsafe-6.i[30243,30256] [2025-04-24 18:27:11,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:27:11,059 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 18:27:11,102 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/fib_unsafe-6.i[30243,30256] [2025-04-24 18:27:11,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 18:27:11,136 INFO L204 MainTranslator]: Completed translation [2025-04-24 18:27:11,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11 WrapperNode [2025-04-24 18:27:11,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 18:27:11,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 18:27:11,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 18:27:11,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 18:27:11,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,174 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-24 18:27:11,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 18:27:11,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 18:27:11,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 18:27:11,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 18:27:11,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 18:27:11,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 18:27:11,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 18:27:11,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 18:27:11,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (1/1) ... [2025-04-24 18:27:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 18:27:11,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:11,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 18:27:11,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 18:27:11,249 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-24 18:27:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-24 18:27:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-24 18:27:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-24 18:27:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-24 18:27:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 18:27:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 18:27:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-24 18:27:11,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 18:27:11,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 18:27:11,251 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 18:27:11,345 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 18:27:11,346 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 18:27:11,479 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 18:27:11,479 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 18:27:11,542 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 18:27:11,542 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 18:27:11,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:27:11 BoogieIcfgContainer [2025-04-24 18:27:11,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 18:27:11,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 18:27:11,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 18:27:11,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 18:27:11,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 06:27:10" (1/3) ... [2025-04-24 18:27:11,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149e3dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:27:11, skipping insertion in model container [2025-04-24 18:27:11,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 06:27:11" (2/3) ... [2025-04-24 18:27:11,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149e3dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 06:27:11, skipping insertion in model container [2025-04-24 18:27:11,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:27:11" (3/3) ... [2025-04-24 18:27:11,551 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i [2025-04-24 18:27:11,561 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 18:27:11,562 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-6.i that has 3 procedures, 26 locations, 27 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-24 18:27:11,562 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 18:27:11,598 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-24 18:27:11,639 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:27:11,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 18:27:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:11,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 18:27:11,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 18:27:11,697 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 18:27:11,709 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 18:27:11,714 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;@39b1c8cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 18:27:11,714 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-24 18:27:12,000 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-24 18:27:12,000 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:12,000 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #1 [2025-04-24 18:27:12,003 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:27:12,003 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:12,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash -585029914, now seen corresponding path program 1 times [2025-04-24 18:27:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:12,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883717528] [2025-04-24 18:27:12,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:12,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-24 18:27:12,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-24 18:27:12,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:12,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:27:12,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883717528] [2025-04-24 18:27:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883717528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:27:12,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 18:27:12,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 18:27:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613145365] [2025-04-24 18:27:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:27:12,223 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-24 18:27:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:27:12,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-24 18:27:12,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-24 18:27:12,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:12,236 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:27:12,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 18:27:12,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:12,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:12,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 18:27:12,317 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-24 18:27:12,317 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:12,317 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #2 [2025-04-24 18:27:12,317 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:27:12,317 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:27:12,318 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,318 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 18:27:12,318 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,318 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:27:12,331 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:12,331 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 18:27:12,332 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:12,332 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-24 18:27:12,332 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,332 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 18:27:12,332 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,332 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:27:12,332 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:12,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1099917870, now seen corresponding path program 1 times [2025-04-24 18:27:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:12,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721148274] [2025-04-24 18:27:12,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:12,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 18:27:12,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 18:27:12,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:12,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:12,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:27:12,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721148274] [2025-04-24 18:27:12,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721148274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:27:12,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038616353] [2025-04-24 18:27:12,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:12,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:12,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:12,470 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-24 18:27:12,471 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-24 18:27:12,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-24 18:27:12,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 18:27:12,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:12,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:12,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-24 18:27:12,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:27:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:12,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 18:27:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038616353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 18:27:12,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 18:27:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-24 18:27:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129958182] [2025-04-24 18:27:12,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 18:27:12,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 18:27:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:27:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 18:27:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-24 18:27:12,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:12,609 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:27:12,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 18:27:12,609 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:12,609 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:12,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:12,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:12,693 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-24 18:27:12,888 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-24 18:27:12,888 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-24 18:27:12,888 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:12,888 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #3 [2025-04-24 18:27:12,888 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:27:12,888 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:27:12,888 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,888 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 18:27:12,888 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,888 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:27:12,888 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:12,888 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 18:27:12,888 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:12,889 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-04-24 18:27:12,889 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,889 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47 [2025-04-24 18:27:12,889 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:12,889 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:27:12,889 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:12,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1414699802, now seen corresponding path program 2 times [2025-04-24 18:27:12,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:12,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795677109] [2025-04-24 18:27:12,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 18:27:12,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:12,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-24 18:27:12,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-24 18:27:12,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 18:27:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:27:13,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795677109] [2025-04-24 18:27:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795677109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:27:13,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360892912] [2025-04-24 18:27:13,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 18:27:13,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:13,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:13,074 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-24 18:27:13,075 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-24 18:27:13,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-24 18:27:13,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-24 18:27:13,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 18:27:13,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:13,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-24 18:27:13,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:27:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:13,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 18:27:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360892912] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 18:27:13,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 18:27:13,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-24 18:27:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259253525] [2025-04-24 18:27:13,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 18:27:13,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 18:27:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:27:13,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 18:27:13,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-24 18:27:13,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:13,281 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:27:13,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 18:27:13,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:13,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:13,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:13,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:13,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:13,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-24 18:27:13,601 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-24 18:27:13,601 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-24 18:27:13,601 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:13,601 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #4 [2025-04-24 18:27:13,601 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:27:13,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:27:13,602 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:13,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 18:27:13,602 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:13,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:27:13,602 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:13,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 18:27:13,602 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:13,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2025-04-24 18:27:13,602 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:13,602 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-24 18:27:13,602 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:13,602 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:27:13,602 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:13,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash 286974438, now seen corresponding path program 3 times [2025-04-24 18:27:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:13,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538483047] [2025-04-24 18:27:13,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 18:27:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:13,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-24 18:27:13,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-24 18:27:13,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-24 18:27:13,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:27:13,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538483047] [2025-04-24 18:27:13,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538483047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:27:13,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328760004] [2025-04-24 18:27:13,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-24 18:27:13,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:13,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:13,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 18:27:13,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 18:27:14,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-24 18:27:14,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-24 18:27:14,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-24 18:27:14,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:14,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-24 18:27:14,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:27:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:14,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 18:27:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328760004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:27:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-24 18:27:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2025-04-24 18:27:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509547316] [2025-04-24 18:27:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:27:14,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-24 18:27:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:27:14,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-24 18:27:14,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-04-24 18:27:14,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:14,252 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:27:14,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 18:27:14,252 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:14,252 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:14,253 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:14,253 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:14,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:14,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:14,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:14,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:14,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-24 18:27:14,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:14,571 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:27:14,571 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:14,571 INFO L139 ounterexampleChecker]: Examining path program with hash 143743242, occurence #1 [2025-04-24 18:27:14,571 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:27:14,571 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:14,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:14,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1631761090, now seen corresponding path program 1 times [2025-04-24 18:27:14,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:14,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045562999] [2025-04-24 18:27:14,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:14,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:14,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-24 18:27:14,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-24 18:27:14,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:14,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:27:14,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045562999] [2025-04-24 18:27:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045562999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:27:14,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105139760] [2025-04-24 18:27:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:14,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:14,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:14,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 18:27:14,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-24 18:27:14,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-24 18:27:14,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-24 18:27:14,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:14,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:14,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 18:27:14,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:27:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-24 18:27:14,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-24 18:27:14,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105139760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 18:27:14,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-24 18:27:14,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2025-04-24 18:27:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484945653] [2025-04-24 18:27:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 18:27:14,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-24 18:27:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:27:14,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-24 18:27:14,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-04-24 18:27:14,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:14,964 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:27:14,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 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-24 18:27:14,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:14,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:14,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:14,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:14,964 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:15,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:15,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:15,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:15,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:15,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:15,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-24 18:27:15,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:15,252 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:27:15,252 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:15,253 INFO L139 ounterexampleChecker]: Examining path program with hash -432632325, occurence #1 [2025-04-24 18:27:15,253 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 18:27:15,253 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:15,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1236009274, now seen corresponding path program 1 times [2025-04-24 18:27:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:15,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115618669] [2025-04-24 18:27:15,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:15,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-24 18:27:15,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-24 18:27:15,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 18:27:15,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115618669] [2025-04-24 18:27:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115618669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 18:27:15,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144064702] [2025-04-24 18:27:15,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 18:27:15,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:15,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 18:27:15,439 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 18:27:15,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-24 18:27:15,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-24 18:27:15,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-24 18:27:15,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:15,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 18:27:15,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-24 18:27:15,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 18:27:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:15,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 18:27:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 18:27:15,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144064702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 18:27:15,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 18:27:15,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2025-04-24 18:27:15,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611314121] [2025-04-24 18:27:15,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 18:27:15,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-24 18:27:15,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 18:27:15,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-24 18:27:15,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-04-24 18:27:15,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:15,715 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 18:27:15,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.647058823529412) internal successors, (96), 17 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 18:27:15,715 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:15,715 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:15,715 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:15,715 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:15,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:15,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 18:27:15,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-24 18:27:15,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 18:27:15,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-24 18:27:15,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:15,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 18:27:15,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-24 18:27:15,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-24 18:27:15,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 18:27:15,992 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 18:27:15,992 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 18:27:15,992 INFO L139 ounterexampleChecker]: Examining path program with hash -432632325, occurence #2 [2025-04-24 18:27:15,992 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 18:27:15,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 18:27:15,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:15,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-24 18:27:15,993 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:15,993 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 18:27:15,995 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:15,996 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 18:27:15,996 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 18:27:15,997 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 61 [2025-04-24 18:27:15,997 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:15,997 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 63 [2025-04-24 18:27:15,997 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:15,997 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-24 18:27:15,997 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 18:27:15,997 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 18:27:15,997 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 18:27:15,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 18:27:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1473502714, now seen corresponding path program 2 times [2025-04-24 18:27:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 18:27:15,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231085038] [2025-04-24 18:27:15,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 18:27:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 18:27:16,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-04-24 18:27:16,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-24 18:27:16,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 18:27:16,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:27:16,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 18:27:16,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-24 18:27:16,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-24 18:27:16,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 18:27:16,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 18:27:16,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 18:27:16,082 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 18:27:16,083 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-24 18:27:16,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-24 18:27:16,084 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-24 18:27:16,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 18:27:16,089 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-04-24 18:27:16,201 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-24 18:27:16,201 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-24 18:27:16,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-24 18:27:16,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.04 06:27:16 BasicIcfg [2025-04-24 18:27:16,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-24 18:27:16,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-24 18:27:16,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-24 18:27:16,214 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-24 18:27:16,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 06:27:11" (3/4) ... [2025-04-24 18:27:16,215 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-24 18:27:16,312 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 34. [2025-04-24 18:27:16,367 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-24 18:27:16,367 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-24 18:27:16,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-24 18:27:16,368 INFO L158 Benchmark]: Toolchain (without parser) took 5594.19ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 111.3MB in the beginning and 248.0MB in the end (delta: -136.7MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2025-04-24 18:27:16,368 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:27:16,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.64ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 89.5MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-24 18:27:16,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.20ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:27:16,368 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.8MB in the end (delta: 916.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-24 18:27:16,369 INFO L158 Benchmark]: RCFGBuilder took 343.31ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 65.4MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-24 18:27:16,369 INFO L158 Benchmark]: TraceAbstraction took 4668.86ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 65.2MB in the beginning and 102.5MB in the end (delta: -37.2MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2025-04-24 18:27:16,369 INFO L158 Benchmark]: Witness Printer took 153.57ms. Allocated memory is still 302.0MB. Free memory was 102.5MB in the beginning and 248.0MB in the end (delta: -145.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2025-04-24 18:27:16,370 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.64ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 89.5MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.20ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 86.8MB in the end (delta: 916.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 343.31ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 65.4MB in the end (delta: 21.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4668.86ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 65.2MB in the beginning and 102.5MB in the end (delta: -37.2MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Witness Printer took 153.57ms. Allocated memory is still 302.0MB. Free memory was 102.5MB in the beginning and 248.0MB in the end (delta: -145.6MB). Peak memory consumption was 9.2MB. 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: 3384, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 781, dependent conditional: 774, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 0, independent unconditional: 2603, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 0, independent unconditional: 2603, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 250, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2610, independent: 2371, independent conditional: 0, independent unconditional: 2371, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2356, Maximal queried relation: 0, Independence queries for same thread: 774, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 34, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3384, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 781, dependent conditional: 774, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 0, independent unconditional: 2603, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2610, independent: 2603, independent conditional: 0, independent unconditional: 2603, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 250, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2610, independent: 2371, independent conditional: 0, independent unconditional: 2371, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2356, Maximal queried relation: 0, Independence queries for same thread: 774 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\at(argc, Pre)=611, \at(argv, Pre)={612:613}, argc=611, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\at(argc, Pre)=611, \at(argv, Pre)={612:613}, argc=611, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\at(argc, Pre)=611, \at(argv, Pre)={612:613}, argc=611, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=611, \at(argv, Pre)={612:613}, argc=611, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] 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)=611, \at(argv, Pre)={612:613}, arg={0:0}, argc=611, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND TRUE 1 p < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 6 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] COND FALSE 1 !(p < 6) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 6) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=7] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=34, i=233, j=377, next=34, p=6, prev=21, q=6, x=8] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=55, i=233, j=377, next=55, p=6, prev=34, q=6, x=9] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=89, i=233, j=377, next=89, p=6, prev=55, q=6, x=10] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=144, i=233, j=377, next=144, p=6, prev=89, q=6, x=11] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, i=233, j=377, next=233, p=6, prev=144, q=6, x=12] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=377, i=233, j=377, next=377, p=6, prev=233, q=6, x=13] [L705] COND TRUE 0 x < 14 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] [L705] COND FALSE 0 !(x < 14) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=611, \at(argv, Pre)={612:613}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=611, assert_cond=0, correct=377, cur=610, i=233, id1=-2, id2=-1, j=377, next=610, p=6, prev=377, q=6, x=14] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, expression=0, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] [L681] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, expression=0, i=233, j=377, next=610, p=6, prev=377, q=6, x=14] - UnprovableResult [Line: 720]: 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: 721]: 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, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.8s, 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: 55, 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, 1.7s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 763 ConstructedInterpolants, 0 QuantifiedInterpolants, 1885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1180 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 536/1666 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 13, ConditionCalculationTime [ms]: 0, ConditionCalculations: 17, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-24 18:27:16,385 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