./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-6.i --full-output --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1f73d82f Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/fib_unsafe-6.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1f73d82-m [2024-11-21 13:38:01,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 13:38:01,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-21 13:38:01,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 13:38:01,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 13:38:01,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 13:38:01,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 13:38:01,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 13:38:01,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 13:38:01,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 13:38:01,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 13:38:01,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 13:38:01,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 13:38:01,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 13:38:01,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 13:38:01,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 13:38:01,314 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 13:38:01,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 13:38:01,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 13:38:01,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Commutativity condition synthesis=SUFFICIENT [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 13:38:01,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 13:38:01,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 13:38:01,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 13:38:01,316 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 13:38:01,316 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 13:38:01,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 854e371c98b43d805c328b457758892c4a501d7b326c2672c089850792494a4b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2024-11-21 13:38:01,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 13:38:01,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 13:38:01,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 13:38:01,806 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 13:38:01,806 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 13:38:01,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/fib_unsafe-6.i [2024-11-21 13:38:03,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c627e1b59/e5817287812342a09a9762e847ceca9b/FLAG3d20cafe5 [2024-11-21 13:38:03,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 13:38:03,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-6.i [2024-11-21 13:38:03,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c627e1b59/e5817287812342a09a9762e847ceca9b/FLAG3d20cafe5 [2024-11-21 13:38:03,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/c627e1b59/e5817287812342a09a9762e847ceca9b [2024-11-21 13:38:03,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 13:38:03,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 13:38:03,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 13:38:03,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 13:38:03,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 13:38:03,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:38:03" (1/1) ... [2024-11-21 13:38:03,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1208a29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:03, skipping insertion in model container [2024-11-21 13:38:03,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:38:03" (1/1) ... [2024-11-21 13:38:03,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 13:38:03,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-6.i[30243,30256] [2024-11-21 13:38:04,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 13:38:04,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 13:38:04,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-6.i[30243,30256] [2024-11-21 13:38:04,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 13:38:04,186 INFO L204 MainTranslator]: Completed translation [2024-11-21 13:38:04,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04 WrapperNode [2024-11-21 13:38:04,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 13:38:04,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 13:38:04,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 13:38:04,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 13:38:04,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,248 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-11-21 13:38:04,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 13:38:04,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 13:38:04,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 13:38:04,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 13:38:04,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 13:38:04,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 13:38:04,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 13:38:04,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 13:38:04,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (1/1) ... [2024-11-21 13:38:04,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 13:38:04,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:04,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 13:38:04,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 13:38:04,389 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-21 13:38:04,390 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-21 13:38:04,390 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-21 13:38:04,390 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-21 13:38:04,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-21 13:38:04,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 13:38:04,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 13:38:04,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-21 13:38:04,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 13:38:04,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 13:38:04,392 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 13:38:04,487 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 13:38:04,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 13:38:04,589 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 13:38:04,589 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 13:38:04,714 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 13:38:04,714 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-21 13:38:04,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:38:04 BoogieIcfgContainer [2024-11-21 13:38:04,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 13:38:04,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 13:38:04,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 13:38:04,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 13:38:04,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:38:03" (1/3) ... [2024-11-21 13:38:04,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f0bde1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:38:04, skipping insertion in model container [2024-11-21 13:38:04,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:38:04" (2/3) ... [2024-11-21 13:38:04,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f0bde1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:38:04, skipping insertion in model container [2024-11-21 13:38:04,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:38:04" (3/3) ... [2024-11-21 13:38:04,729 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6.i [2024-11-21 13:38:04,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 13:38:04,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-6.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2024-11-21 13:38:04,747 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 13:38:04,770 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 13:38:04,801 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 13:38:04,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 13:38:04,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:04,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 13:38:04,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 13:38:04,855 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 13:38:04,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 13:38:04,871 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@316b21ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 13:38:04,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-21 13:38:05,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:05,157 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:05,157 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #1 [2024-11-21 13:38:05,157 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 13:38:05,157 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:05,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash 613904055, now seen corresponding path program 1 times [2024-11-21 13:38:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104006276] [2024-11-21 13:38:05,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:05,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 13:38:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104006276] [2024-11-21 13:38:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104006276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 13:38:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 13:38:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 13:38:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025997639] [2024-11-21 13:38:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 13:38:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 13:38:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 13:38:05,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 13:38:05,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 13:38:05,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:05,526 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 13:38:05,528 INFO L472 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) [2024-11-21 13:38:05,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:05,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 13:38:05,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:05,616 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:05,616 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #2 [2024-11-21 13:38:05,616 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 13:38:05,616 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-11-21 13:38:05,616 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:05,616 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-11-21 13:38:05,616 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:05,616 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 13:38:05,637 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:05,641 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-11-21 13:38:05,641 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:05,641 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2024-11-21 13:38:05,641 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:05,641 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2024-11-21 13:38:05,641 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:05,642 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 13:38:05,642 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:05,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash 896195671, now seen corresponding path program 1 times [2024-11-21 13:38:05,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:05,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021055547] [2024-11-21 13:38:05,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:05,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 13:38:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021055547] [2024-11-21 13:38:05,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021055547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 13:38:05,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651655555] [2024-11-21 13:38:05,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:05,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:05,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:05,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 13:38:05,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 13:38:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:05,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 13:38:05,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 13:38:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:05,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 13:38:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:05,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651655555] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 13:38:05,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 13:38:05,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-21 13:38:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642169187] [2024-11-21 13:38:05,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 13:38:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 13:38:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 13:38:05,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 13:38:05,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 13:38:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:05,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 13:38:05,967 INFO L472 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) [2024-11-21 13:38:05,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:05,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:06,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-21 13:38:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:06,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:06,239 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:06,240 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #3 [2024-11-21 13:38:06,240 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 13:38:06,240 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-11-21 13:38:06,240 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:06,240 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-11-21 13:38:06,240 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:06,243 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 13:38:06,243 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:06,243 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-11-21 13:38:06,243 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:06,243 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2024-11-21 13:38:06,243 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:06,243 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47 [2024-11-21 13:38:06,243 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:06,243 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 13:38:06,243 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:06,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:06,244 INFO L85 PathProgramCache]: Analyzing trace with hash -333887817, now seen corresponding path program 2 times [2024-11-21 13:38:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:06,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411761816] [2024-11-21 13:38:06,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:06,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 13:38:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411761816] [2024-11-21 13:38:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411761816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 13:38:06,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448477295] [2024-11-21 13:38:06,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 13:38:06,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:06,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:06,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 13:38:06,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 13:38:06,541 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 13:38:06,541 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 13:38:06,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 13:38:06,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 13:38:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:06,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 13:38:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448477295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 13:38:06,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 13:38:06,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-21 13:38:06,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513569548] [2024-11-21 13:38:06,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 13:38:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-21 13:38:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 13:38:06,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-21 13:38:06,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-21 13:38:06,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:06,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 13:38:06,743 INFO L472 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) [2024-11-21 13:38:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:06,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:06,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-21 13:38:07,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:07,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:07,105 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:07,105 INFO L139 ounterexampleChecker]: Examining path program with hash -1042394175, occurence #4 [2024-11-21 13:38:07,105 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 13:38:07,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-11-21 13:38:07,105 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:07,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-11-21 13:38:07,105 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:07,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 13:38:07,105 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:07,105 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-11-21 13:38:07,106 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:07,106 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2024-11-21 13:38:07,106 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:07,106 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2024-11-21 13:38:07,106 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:07,106 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 13:38:07,106 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 757762743, now seen corresponding path program 3 times [2024-11-21 13:38:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963061064] [2024-11-21 13:38:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 13:38:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963061064] [2024-11-21 13:38:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963061064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 13:38:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282559119] [2024-11-21 13:38:07,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 13:38:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:07,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:07,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 13:38:07,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 13:38:07,652 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-21 13:38:07,652 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 13:38:07,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-21 13:38:07,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 13:38:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:07,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 13:38:07,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282559119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 13:38:07,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 13:38:07,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 24 [2024-11-21 13:38:07,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161148098] [2024-11-21 13:38:07,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 13:38:07,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-21 13:38:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 13:38:07,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-21 13:38:07,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-21 13:38:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:07,894 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 13:38:07,894 INFO L472 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) [2024-11-21 13:38:07,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:07,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:07,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:07,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:08,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-21 13:38:08,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:08,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:08,268 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:08,270 INFO L139 ounterexampleChecker]: Examining path program with hash -312655665, occurence #1 [2024-11-21 13:38:08,270 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 13:38:08,270 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:08,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 590472479, now seen corresponding path program 1 times [2024-11-21 13:38:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:08,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064560591] [2024-11-21 13:38:08,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:08,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:08,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 13:38:08,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064560591] [2024-11-21 13:38:08,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064560591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 13:38:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927521819] [2024-11-21 13:38:08,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:08,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 13:38:08,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 13:38:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:08,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 13:38:08,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 13:38:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-21 13:38:08,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 13:38:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927521819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 13:38:08,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 13:38:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2024-11-21 13:38:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044465342] [2024-11-21 13:38:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 13:38:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 13:38:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 13:38:08,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 13:38:08,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2024-11-21 13:38:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:08,795 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 13:38:08,795 INFO L472 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) [2024-11-21 13:38:08,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:08,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:08,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:08,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:08,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:08,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 13:38:09,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:09,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:09,077 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:09,077 INFO L139 ounterexampleChecker]: Examining path program with hash -1127784628, occurence #1 [2024-11-21 13:38:09,077 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 13:38:09,077 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2125783337, now seen corresponding path program 1 times [2024-11-21 13:38:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317343893] [2024-11-21 13:38:09,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 13:38:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317343893] [2024-11-21 13:38:09,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317343893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 13:38:09,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842251773] [2024-11-21 13:38:09,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:09,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 13:38:09,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 13:38:09,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 13:38:09,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 13:38:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 13:38:09,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-21 13:38:09,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 13:38:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:09,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 13:38:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 13:38:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842251773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 13:38:09,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 13:38:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2024-11-21 13:38:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098287230] [2024-11-21 13:38:09,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 13:38:09,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-21 13:38:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 13:38:09,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-21 13:38:09,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-11-21 13:38:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:09,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 13:38:09,528 INFO L472 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) [2024-11-21 13:38:09,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:09,528 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:09,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:09,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:09,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:09,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 13:38:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 13:38:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 13:38:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 13:38:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 13:38:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-21 13:38:09,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-21 13:38:09,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-21 13:38:09,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 13:38:09,792 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 13:38:09,793 INFO L139 ounterexampleChecker]: Examining path program with hash -1127784628, occurence #2 [2024-11-21 13:38:09,793 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-11-21 13:38:09,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-11-21 13:38:09,794 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:09,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-11-21 13:38:09,794 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:09,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-11-21 13:38:09,794 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:09,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-11-21 13:38:09,794 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-11-21 13:38:09,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 63 [2024-11-21 13:38:09,794 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:09,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2024-11-21 13:38:09,794 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-11-21 13:38:09,794 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-11-21 13:38:09,794 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 13:38:09,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 13:38:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash 230076439, now seen corresponding path program 2 times [2024-11-21 13:38:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 13:38:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184110532] [2024-11-21 13:38:09,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 13:38:09,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 13:38:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 13:38:09,826 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 13:38:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 13:38:09,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 13:38:09,870 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 13:38:09,870 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-21 13:38:09,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-21 13:38:09,872 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-21 13:38:09,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 13:38:09,876 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2024-11-21 13:38:09,941 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-21 13:38:09,941 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 13:38:09,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-21 13:38:09,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:38:09 BasicIcfg [2024-11-21 13:38:09,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 13:38:09,960 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 13:38:09,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 13:38:09,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 13:38:09,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:38:04" (3/4) ... [2024-11-21 13:38:09,961 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 13:38:10,039 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 34. [2024-11-21 13:38:10,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-11-21 13:38:10,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2024-11-21 13:38:10,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 13:38:10,085 INFO L158 Benchmark]: Toolchain (without parser) took 6443.09ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 59.0MB in the beginning and 47.1MB in the end (delta: 11.8MB). Peak memory consumption was 59.0MB. Max. memory is 16.1GB. [2024-11-21 13:38:10,086 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 13:38:10,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.56ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 39.4MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 13:38:10,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.56ms. Allocated memory is still 83.9MB. Free memory was 39.4MB in the beginning and 37.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 13:38:10,086 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 83.9MB. Free memory was 37.7MB in the beginning and 36.8MB in the end (delta: 933.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 13:38:10,086 INFO L158 Benchmark]: RCFGBuilder took 419.83ms. Allocated memory is still 83.9MB. Free memory was 36.8MB in the beginning and 54.4MB in the end (delta: -17.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-21 13:38:10,087 INFO L158 Benchmark]: TraceAbstraction took 5243.02ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 53.8MB in the beginning and 66.3MB in the end (delta: -12.5MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-11-21 13:38:10,087 INFO L158 Benchmark]: Witness Printer took 125.18ms. Allocated memory is still 134.2MB. Free memory was 66.3MB in the beginning and 47.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 13:38:10,088 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 83.9MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.56ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 39.4MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.56ms. Allocated memory is still 83.9MB. Free memory was 39.4MB in the beginning and 37.7MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 83.9MB. Free memory was 37.7MB in the beginning and 36.8MB in the end (delta: 933.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 419.83ms. Allocated memory is still 83.9MB. Free memory was 36.8MB in the beginning and 54.4MB in the end (delta: -17.6MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5243.02ms. Allocated memory was 83.9MB in the beginning and 134.2MB in the end (delta: 50.3MB). Free memory was 53.8MB in the beginning and 66.3MB in the end (delta: -12.5MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 125.18ms. Allocated memory is still 134.2MB. Free memory was 66.3MB in the beginning and 47.1MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. 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: 3119, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 516, dependent conditional: 509, 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: 260, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 209, dependent conditional: 0, dependent unconditional: 209, 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: 509, 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: 3119, independent: 2603, independent conditional: 2356, independent unconditional: 247, dependent: 516, dependent conditional: 509, 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: 260, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 209, dependent conditional: 0, dependent unconditional: 209, 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: 509 - 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 [\old(argc)=611, \old(argv)={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 [\old(argc)=611, \old(argv)={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 [\old(argc)=611, \old(argv)={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 [\old(arg)={0:0}, \old(argc)=611, \old(argv)={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 [\old(arg)={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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=611, \old(argv)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=611, \old(argv)={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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=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, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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, 2.2s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 23 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]: 21, ConditionCalculationTime [ms]: 0, ConditionCalculations: 16, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-21 13:38:10,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE