./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:23:11,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:23:11,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:23:11,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:23:11,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:23:11,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:23:11,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:23:11,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:23:11,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:23:11,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:23:11,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:23:11,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:23:11,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:23:11,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:23:11,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:23:11,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:23:11,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:11,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:11,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:23:11,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:23:11,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:23:11,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:23:11,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:23:11,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:23:11,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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 -> Automizer 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-01-09 16:23:11,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:23:11,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:23:11,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:23:11,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:23:11,684 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:23:11,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-01-09 16:23:12,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c470c8844/0e395216ef94450e95a107394d87f803/FLAGc140846b1 [2025-01-09 16:23:13,077 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:23:13,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-01-09 16:23:13,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c470c8844/0e395216ef94450e95a107394d87f803/FLAGc140846b1 [2025-01-09 16:23:13,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c470c8844/0e395216ef94450e95a107394d87f803 [2025-01-09 16:23:13,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:23:13,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:23:13,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:13,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:23:13,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:23:13,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd9339c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13, skipping insertion in model container [2025-01-09 16:23:13,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:23:13,603 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-ext/11_fmaxsymopt.i[30863,30876] [2025-01-09 16:23:13,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:13,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:23:13,659 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-ext/11_fmaxsymopt.i[30863,30876] [2025-01-09 16:23:13,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:23:13,687 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:23:13,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13 WrapperNode [2025-01-09 16:23:13,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:23:13,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:13,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:23:13,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:23:13,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,720 INFO L138 Inliner]: procedures = 164, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-01-09 16:23:13,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:23:13,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:23:13,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:23:13,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:23:13,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,745 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-01-09 16:23:13,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:23:13,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:23:13,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:23:13,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:23:13,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (1/1) ... [2025-01-09 16:23:13,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:23:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:13,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:23:13,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:23:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:23:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:23:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:23:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 16:23:13,801 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:23:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:23:13,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:23:13,803 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:23:13,896 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:23:13,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:23:14,020 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:23:14,021 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:23:14,127 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:23:14,127 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:23:14,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:14 BoogieIcfgContainer [2025-01-09 16:23:14,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:23:14,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:23:14,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:23:14,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:23:14,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:13" (1/3) ... [2025-01-09 16:23:14,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ead2674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:14, skipping insertion in model container [2025-01-09 16:23:14,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:13" (2/3) ... [2025-01-09 16:23:14,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ead2674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:14, skipping insertion in model container [2025-01-09 16:23:14,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:14" (3/3) ... [2025-01-09 16:23:14,134 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-01-09 16:23:14,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:23:14,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:23:14,146 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:23:14,198 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:14,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 25 transitions, 54 flow [2025-01-09 16:23:14,255 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-09 16:23:14,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-01-09 16:23:14,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 25 transitions, 54 flow [2025-01-09 16:23:14,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 25 transitions, 54 flow [2025-01-09 16:23:14,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:14,297 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=PETRI_NET, 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;@4ae5334e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:14,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:23:14,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:14,306 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-01-09 16:23:14,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:14,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:14,306 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-09 16:23:14,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:23:14,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1759397131, now seen corresponding path program 1 times [2025-01-09 16:23:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001933733] [2025-01-09 16:23:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:14,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 16:23:14,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 16:23:14,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:14,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001933733] [2025-01-09 16:23:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001933733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631575252] [2025-01-09 16:23:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:14,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:14,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:14,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:14,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-01-09 16:23:14,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 25 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:14,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:14,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-01-09 16:23:14,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:14,663 INFO L124 PetriNetUnfolderBase]: 23/73 cut-off events. [2025-01-09 16:23:14,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:14,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 73 events. 23/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 16 based on Foata normal form. 3/71 useless extension candidates. Maximal degree in co-relation 109. Up to 51 conditions per place. [2025-01-09 16:23:14,665 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 14 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2025-01-09 16:23:14,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 84 flow [2025-01-09 16:23:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-09 16:23:14,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-01-09 16:23:14,676 INFO L175 Difference]: Start difference. First operand has 24 places, 25 transitions, 54 flow. Second operand 3 states and 43 transitions. [2025-01-09 16:23:14,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 84 flow [2025-01-09 16:23:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 84 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:14,682 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 62 flow [2025-01-09 16:23:14,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2025-01-09 16:23:14,692 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-01-09 16:23:14,692 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2025-01-09 16:23:14,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:14,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:14,692 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:14,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:23:14,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:23:14,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2013576423, now seen corresponding path program 1 times [2025-01-09 16:23:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:14,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930900491] [2025-01-09 16:23:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:14,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:14,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:14,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:14,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930900491] [2025-01-09 16:23:14,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930900491] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965080812] [2025-01-09 16:23:14,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:14,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:14,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:14,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:23:14,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:14,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:14,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:14,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:14,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:23:14,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:14,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:14,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965080812] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:14,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:14,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:23:14,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519162622] [2025-01-09 16:23:14,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:23:14,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:14,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:23:14,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:23:14,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-01-09 16:23:14,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:14,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:14,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-01-09 16:23:14,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:14,929 INFO L124 PetriNetUnfolderBase]: 23/76 cut-off events. [2025-01-09 16:23:14,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:23:14,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 76 events. 23/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 16 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 133. Up to 51 conditions per place. [2025-01-09 16:23:14,930 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2025-01-09 16:23:14,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 112 flow [2025-01-09 16:23:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:23:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:23:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-01-09 16:23:14,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-01-09 16:23:14,931 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 70 transitions. [2025-01-09 16:23:14,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 112 flow [2025-01-09 16:23:14,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:14,932 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 94 flow [2025-01-09 16:23:14,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2025-01-09 16:23:14,934 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2025-01-09 16:23:14,934 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 94 flow [2025-01-09 16:23:14,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:14,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:14,934 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-01-09 16:23:14,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:23:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:15,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:23:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash -952870773, now seen corresponding path program 2 times [2025-01-09 16:23:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631964877] [2025-01-09 16:23:15,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:15,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:23:15,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:23:15,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:23:15,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631964877] [2025-01-09 16:23:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631964877] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543443824] [2025-01-09 16:23:15,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:15,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:15,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:15,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:15,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:23:15,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-09 16:23:15,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:23:15,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:23:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:15,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:23:15,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:15,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543443824] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:15,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 16:23:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289817499] [2025-01-09 16:23:15,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:15,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:23:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:15,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:23:15,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:23:15,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-01-09 16:23:15,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:15,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:15,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-01-09 16:23:15,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:15,457 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2025-01-09 16:23:15,458 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 16:23:15,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 78 events. 23/78 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 168 event pairs, 16 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 124. Up to 51 conditions per place. [2025-01-09 16:23:15,458 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-01-09 16:23:15,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 148 flow [2025-01-09 16:23:15,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:23:15,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:23:15,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-01-09 16:23:15,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-01-09 16:23:15,461 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 94 flow. Second operand 8 states and 87 transitions. [2025-01-09 16:23:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 148 flow [2025-01-09 16:23:15,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 134 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:15,463 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 116 flow [2025-01-09 16:23:15,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2025-01-09 16:23:15,464 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 17 predicate places. [2025-01-09 16:23:15,464 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 116 flow [2025-01-09 16:23:15,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:15,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:15,465 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 1, 1, 1, 1, 1] [2025-01-09 16:23:15,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:15,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:15,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:23:15,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1839020619, now seen corresponding path program 3 times [2025-01-09 16:23:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:15,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510878981] [2025-01-09 16:23:15,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:23:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:15,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-01-09 16:23:15,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:23:15,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 16:23:15,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:15,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:15,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:23:15,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:23:15,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:15,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:15,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:15,718 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:15,719 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:23:15,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:23:15,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:23:15,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:23:15,721 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-01-09 16:23:15,724 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:15,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:23:15,747 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:15,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 43 transitions, 96 flow [2025-01-09 16:23:15,758 INFO L124 PetriNetUnfolderBase]: 7/48 cut-off events. [2025-01-09 16:23:15,758 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:23:15,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 48 events. 7/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2025-01-09 16:23:15,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 43 transitions, 96 flow [2025-01-09 16:23:15,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 43 transitions, 96 flow [2025-01-09 16:23:15,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:15,759 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=PETRI_NET, 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;@4ae5334e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:15,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:23:15,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:15,766 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-01-09 16:23:15,766 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:15,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:15,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:15,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1429838104, now seen corresponding path program 1 times [2025-01-09 16:23:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346465669] [2025-01-09 16:23:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:15,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:15,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:15,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:15,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346465669] [2025-01-09 16:23:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346465669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:15,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685017565] [2025-01-09 16:23:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:15,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:15,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:15,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:15,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-01-09 16:23:15,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:15,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:15,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-01-09 16:23:15,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:15,911 INFO L124 PetriNetUnfolderBase]: 452/938 cut-off events. [2025-01-09 16:23:15,911 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 16:23:15,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 938 events. 452/938 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4849 event pairs, 376 based on Foata normal form. 83/968 useless extension candidates. Maximal degree in co-relation 954. Up to 708 conditions per place. [2025-01-09 16:23:15,917 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2025-01-09 16:23:15,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 144 flow [2025-01-09 16:23:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-09 16:23:15,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-01-09 16:23:15,919 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 96 flow. Second operand 3 states and 75 transitions. [2025-01-09 16:23:15,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 144 flow [2025-01-09 16:23:15,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:15,920 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 102 flow [2025-01-09 16:23:15,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-01-09 16:23:15,921 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2025-01-09 16:23:15,921 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 102 flow [2025-01-09 16:23:15,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:15,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:15,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:15,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:23:15,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:15,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash 20644341, now seen corresponding path program 1 times [2025-01-09 16:23:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478228035] [2025-01-09 16:23:15,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:15,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:15,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:15,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:15,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478228035] [2025-01-09 16:23:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478228035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894457759] [2025-01-09 16:23:15,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:15,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:15,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:15,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:23:16,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:16,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:16,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:16,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:23:16,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:16,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894457759] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:16,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:23:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054770789] [2025-01-09 16:23:16,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:16,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:23:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:16,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:23:16,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:23:16,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-01-09 16:23:16,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:16,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:16,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-01-09 16:23:16,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:16,188 INFO L124 PetriNetUnfolderBase]: 452/941 cut-off events. [2025-01-09 16:23:16,188 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-09 16:23:16,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 941 events. 452/941 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4833 event pairs, 376 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 1682. Up to 708 conditions per place. [2025-01-09 16:23:16,192 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2025-01-09 16:23:16,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 172 flow [2025-01-09 16:23:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:23:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:23:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-01-09 16:23:16,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2025-01-09 16:23:16,197 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 102 flow. Second operand 6 states and 122 transitions. [2025-01-09 16:23:16,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 172 flow [2025-01-09 16:23:16,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 168 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:16,199 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 134 flow [2025-01-09 16:23:16,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-01-09 16:23:16,199 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-01-09 16:23:16,199 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 134 flow [2025-01-09 16:23:16,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:16,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:16,199 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:16,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:16,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:16,400 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:16,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -21272488, now seen corresponding path program 2 times [2025-01-09 16:23:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456393454] [2025-01-09 16:23:16,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:16,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 16:23:16,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-01-09 16:23:16,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:23:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:23:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456393454] [2025-01-09 16:23:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456393454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382038859] [2025-01-09 16:23:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:16,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:16,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:16,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:16,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-01-09 16:23:16,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:16,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:16,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-01-09 16:23:16,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:16,652 INFO L124 PetriNetUnfolderBase]: 764/1594 cut-off events. [2025-01-09 16:23:16,654 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-09 16:23:16,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1594 events. 764/1594 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9578 event pairs, 331 based on Foata normal form. 0/1512 useless extension candidates. Maximal degree in co-relation 2842. Up to 634 conditions per place. [2025-01-09 16:23:16,660 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 46 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2025-01-09 16:23:16,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 271 flow [2025-01-09 16:23:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-01-09 16:23:16,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2025-01-09 16:23:16,661 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 134 flow. Second operand 3 states and 87 transitions. [2025-01-09 16:23:16,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 271 flow [2025-01-09 16:23:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 257 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:16,664 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 134 flow [2025-01-09 16:23:16,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-01-09 16:23:16,665 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-01-09 16:23:16,665 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 134 flow [2025-01-09 16:23:16,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:16,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:16,665 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:23:16,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:23:16,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 109797105, now seen corresponding path program 1 times [2025-01-09 16:23:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948325387] [2025-01-09 16:23:16,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:16,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:23:16,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:23:16,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:16,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948325387] [2025-01-09 16:23:16,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948325387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643122834] [2025-01-09 16:23:16,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:16,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:16,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:16,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:16,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:23:16,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:23:16,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:23:16,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:16,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:16,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:23:16,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:16,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643122834] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:16,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:16,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 16:23:16,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789798241] [2025-01-09 16:23:16,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:16,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:23:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:16,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:23:16,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:23:16,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-01-09 16:23:16,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 134 flow. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:16,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:16,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-01-09 16:23:16,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:17,081 INFO L124 PetriNetUnfolderBase]: 776/1624 cut-off events. [2025-01-09 16:23:17,082 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2025-01-09 16:23:17,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 1624 events. 776/1624 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9741 event pairs, 646 based on Foata normal form. 2/1532 useless extension candidates. Maximal degree in co-relation 3050. Up to 1206 conditions per place. [2025-01-09 16:23:17,087 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 26 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-01-09 16:23:17,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 212 flow [2025-01-09 16:23:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:23:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:23:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2025-01-09 16:23:17,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44476744186046513 [2025-01-09 16:23:17,089 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 134 flow. Second operand 8 states and 153 transitions. [2025-01-09 16:23:17,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 212 flow [2025-01-09 16:23:17,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 47 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:17,091 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 166 flow [2025-01-09 16:23:17,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-01-09 16:23:17,092 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2025-01-09 16:23:17,092 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 166 flow [2025-01-09 16:23:17,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:17,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:17,092 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1] [2025-01-09 16:23:17,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:17,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 16:23:17,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:23:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1226654353, now seen corresponding path program 2 times [2025-01-09 16:23:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251723168] [2025-01-09 16:23:17,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:17,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-09 16:23:17,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:23:17,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:23:17,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:17,311 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:17,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:23:17,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:23:17,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:17,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:17,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:17,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:17,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:23:17,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:23:17,330 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:23:17,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:23:17,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:23:17,335 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-01-09 16:23:17,335 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:17,335 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:23:17,359 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 140 flow [2025-01-09 16:23:17,365 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2025-01-09 16:23:17,365 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:23:17,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 69 events. 10/69 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 200 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-01-09 16:23:17,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 140 flow [2025-01-09 16:23:17,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 140 flow [2025-01-09 16:23:17,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:17,367 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=PETRI_NET, 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;@4ae5334e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:17,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:23:17,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:17,369 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-01-09 16:23:17,369 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:17,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:17,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:17,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 490526505, now seen corresponding path program 1 times [2025-01-09 16:23:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713190481] [2025-01-09 16:23:17,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:17,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:17,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:17,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:17,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:17,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713190481] [2025-01-09 16:23:17,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713190481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:17,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:17,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:17,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992439555] [2025-01-09 16:23:17,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:17,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:17,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:17,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:17,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:17,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-01-09 16:23:17,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:17,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:17,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-01-09 16:23:17,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:18,068 INFO L124 PetriNetUnfolderBase]: 6485/10722 cut-off events. [2025-01-09 16:23:18,069 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2025-01-09 16:23:18,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19888 conditions, 10722 events. 6485/10722 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 72443 event pairs, 5560 based on Foata normal form. 1265/11467 useless extension candidates. Maximal degree in co-relation 2088. Up to 8808 conditions per place. [2025-01-09 16:23:18,126 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 34 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2025-01-09 16:23:18,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 206 flow [2025-01-09 16:23:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-01-09 16:23:18,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846994535519126 [2025-01-09 16:23:18,127 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 140 flow. Second operand 3 states and 107 transitions. [2025-01-09 16:23:18,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 206 flow [2025-01-09 16:23:18,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 204 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:18,130 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 142 flow [2025-01-09 16:23:18,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2025-01-09 16:23:18,131 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-01-09 16:23:18,133 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 142 flow [2025-01-09 16:23:18,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:18,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:18,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:18,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:23:18,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:18,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:18,134 INFO L85 PathProgramCache]: Analyzing trace with hash 495760195, now seen corresponding path program 1 times [2025-01-09 16:23:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230750085] [2025-01-09 16:23:18,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:18,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:18,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:18,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:18,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:18,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:18,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230750085] [2025-01-09 16:23:18,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230750085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:18,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768146205] [2025-01-09 16:23:18,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:18,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:18,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:23:18,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:18,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:18,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:18,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:23:18,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:18,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:18,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768146205] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:18,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:18,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:23:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544055774] [2025-01-09 16:23:18,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:18,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:23:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:18,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:23:18,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:23:18,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-01-09 16:23:18,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 142 flow. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:18,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:18,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-01-09 16:23:18,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:19,024 INFO L124 PetriNetUnfolderBase]: 6485/10725 cut-off events. [2025-01-09 16:23:19,024 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-01-09 16:23:19,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19823 conditions, 10725 events. 6485/10725 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 72532 event pairs, 5560 based on Foata normal form. 0/10205 useless extension candidates. Maximal degree in co-relation 19809. Up to 8808 conditions per place. [2025-01-09 16:23:19,068 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 34 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-01-09 16:23:19,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 232 flow [2025-01-09 16:23:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:23:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:23:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2025-01-09 16:23:19,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2025-01-09 16:23:19,069 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 142 flow. Second operand 6 states and 174 transitions. [2025-01-09 16:23:19,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 232 flow [2025-01-09 16:23:19,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:19,071 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 174 flow [2025-01-09 16:23:19,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-01-09 16:23:19,071 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-01-09 16:23:19,072 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 174 flow [2025-01-09 16:23:19,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:19,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:19,072 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:19,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:23:19,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 16:23:19,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1604317783, now seen corresponding path program 2 times [2025-01-09 16:23:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244018061] [2025-01-09 16:23:19,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:19,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:19,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 16:23:19,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-01-09 16:23:19,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:23:19,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:23:19,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:19,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244018061] [2025-01-09 16:23:19,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244018061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:19,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:19,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363465034] [2025-01-09 16:23:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:19,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:19,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:19,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:19,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:19,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-01-09 16:23:19,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:19,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:19,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-01-09 16:23:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:20,335 INFO L124 PetriNetUnfolderBase]: 10967/18269 cut-off events. [2025-01-09 16:23:20,336 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-01-09 16:23:20,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33701 conditions, 18269 events. 10967/18269 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 136735 event pairs, 4912 based on Foata normal form. 0/17483 useless extension candidates. Maximal degree in co-relation 33665. Up to 7834 conditions per place. [2025-01-09 16:23:20,409 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 66 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-01-09 16:23:20,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 376 flow [2025-01-09 16:23:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-09 16:23:20,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6994535519125683 [2025-01-09 16:23:20,411 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 174 flow. Second operand 3 states and 128 transitions. [2025-01-09 16:23:20,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 376 flow [2025-01-09 16:23:20,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:20,413 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 174 flow [2025-01-09 16:23:20,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-01-09 16:23:20,414 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-01-09 16:23:20,414 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 174 flow [2025-01-09 16:23:20,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:20,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:20,414 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:20,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:23:20,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1659480698, now seen corresponding path program 1 times [2025-01-09 16:23:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:20,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56415883] [2025-01-09 16:23:20,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:20,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:23:20,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:23:20,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:20,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:23:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:20,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56415883] [2025-01-09 16:23:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56415883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:20,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689852171] [2025-01-09 16:23:20,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:20,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:20,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 61 [2025-01-09 16:23:20,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:20,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:20,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 61 [2025-01-09 16:23:20,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:22,270 INFO L124 PetriNetUnfolderBase]: 18668/31003 cut-off events. [2025-01-09 16:23:22,270 INFO L125 PetriNetUnfolderBase]: For 4419/4419 co-relation queries the response was YES. [2025-01-09 16:23:22,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59768 conditions, 31003 events. 18668/31003 cut-off events. For 4419/4419 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 249888 event pairs, 8353 based on Foata normal form. 0/29696 useless extension candidates. Maximal degree in co-relation 59737. Up to 13303 conditions per place. [2025-01-09 16:23:22,430 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 69 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-01-09 16:23:22,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 391 flow [2025-01-09 16:23:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-01-09 16:23:22,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6939890710382514 [2025-01-09 16:23:22,431 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 174 flow. Second operand 3 states and 127 transitions. [2025-01-09 16:23:22,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 391 flow [2025-01-09 16:23:22,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:22,446 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 184 flow [2025-01-09 16:23:22,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2025-01-09 16:23:22,447 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-01-09 16:23:22,447 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 184 flow [2025-01-09 16:23:22,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:22,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:22,447 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:22,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:23:22,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash -96474446, now seen corresponding path program 1 times [2025-01-09 16:23:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286568641] [2025-01-09 16:23:22,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:22,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:23:22,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:23:22,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:22,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286568641] [2025-01-09 16:23:22,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286568641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:22,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65458372] [2025-01-09 16:23:22,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:22,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:22,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:22,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:23:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:23:22,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:23:22,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:22,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:22,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:23:22,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:22,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:22,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65458372] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:22,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:22,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 16:23:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221842379] [2025-01-09 16:23:22,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:23:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:22,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:23:22,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:23:22,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 61 [2025-01-09 16:23:22,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 184 flow. Second operand has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:22,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:22,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 61 [2025-01-09 16:23:22,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:24,277 INFO L124 PetriNetUnfolderBase]: 18836/31247 cut-off events. [2025-01-09 16:23:24,278 INFO L125 PetriNetUnfolderBase]: For 5512/5512 co-relation queries the response was YES. [2025-01-09 16:23:24,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61813 conditions, 31247 events. 18836/31247 cut-off events. For 5512/5512 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 251507 event pairs, 16018 based on Foata normal form. 2/29727 useless extension candidates. Maximal degree in co-relation 61773. Up to 25299 conditions per place. [2025-01-09 16:23:24,454 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 38 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2025-01-09 16:23:24,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 65 transitions, 286 flow [2025-01-09 16:23:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:23:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:23:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 219 transitions. [2025-01-09 16:23:24,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4487704918032787 [2025-01-09 16:23:24,456 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 184 flow. Second operand 8 states and 219 transitions. [2025-01-09 16:23:24,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 65 transitions, 286 flow [2025-01-09 16:23:24,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 65 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:23:24,480 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 216 flow [2025-01-09 16:23:24,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2025-01-09 16:23:24,482 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2025-01-09 16:23:24,482 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 216 flow [2025-01-09 16:23:24,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.77777777777778) internal successors, (214), 9 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:24,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:24,482 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:24,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 16:23:24,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:23:24,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1578889358, now seen corresponding path program 2 times [2025-01-09 16:23:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742484513] [2025-01-09 16:23:24,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:24,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:24,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-09 16:23:24,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:23:24,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:23:24,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:24,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:23:24,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:23:24,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:24,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:24,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:24,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:24,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:23:24,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:23:24,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:23:24,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:23:24,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:23:24,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:23:24,722 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-01-09 16:23:24,722 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:23:24,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:23:24,755 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:23:24,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 186 flow [2025-01-09 16:23:24,764 INFO L124 PetriNetUnfolderBase]: 13/90 cut-off events. [2025-01-09 16:23:24,764 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:23:24,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 90 events. 13/90 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 270 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2025-01-09 16:23:24,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 186 flow [2025-01-09 16:23:24,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 186 flow [2025-01-09 16:23:24,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:23:24,767 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=PETRI_NET, 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;@4ae5334e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:23:24,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:23:24,769 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:23:24,769 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-01-09 16:23:24,769 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:23:24,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:24,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:24,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:24,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash 185252474, now seen corresponding path program 1 times [2025-01-09 16:23:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102084181] [2025-01-09 16:23:24,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:24,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:23:24,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:23:24,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:24,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:24,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:24,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102084181] [2025-01-09 16:23:24,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102084181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:24,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:24,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:23:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374065547] [2025-01-09 16:23:24,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:24,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:24,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:24,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:24,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:24,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-01-09 16:23:24,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:24,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:24,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-01-09 16:23:24,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:31,243 INFO L124 PetriNetUnfolderBase]: 80345/117739 cut-off events. [2025-01-09 16:23:31,243 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-01-09 16:23:31,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223134 conditions, 117739 events. 80345/117739 cut-off events. For 9197/9197 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 906681 event pairs, 69712 based on Foata normal form. 16246/129231 useless extension candidates. Maximal degree in co-relation 19970. Up to 101391 conditions per place. [2025-01-09 16:23:31,841 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 44 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-01-09 16:23:31,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 270 flow [2025-01-09 16:23:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:23:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:23:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-01-09 16:23:31,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5864978902953587 [2025-01-09 16:23:31,843 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 186 flow. Second operand 3 states and 139 transitions. [2025-01-09 16:23:31,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 270 flow [2025-01-09 16:23:31,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 264 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-09 16:23:31,849 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 182 flow [2025-01-09 16:23:31,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-01-09 16:23:31,850 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-01-09 16:23:31,850 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 182 flow [2025-01-09 16:23:31,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:31,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:31,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:31,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:23:31,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash -864495645, now seen corresponding path program 1 times [2025-01-09 16:23:31,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:31,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227837166] [2025-01-09 16:23:31,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:31,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:31,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:31,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:31,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227837166] [2025-01-09 16:23:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227837166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:23:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437896147] [2025-01-09 16:23:31,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:23:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:23:31,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:23:31,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:23:31,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:23:31,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:23:31,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:31,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:31,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:23:31,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:23:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:31,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:23:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:23:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437896147] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:23:31,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:23:31,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-09 16:23:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156332803] [2025-01-09 16:23:31,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:23:31,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:23:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:31,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:23:31,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:23:31,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2025-01-09 16:23:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:31,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2025-01-09 16:23:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:23:38,773 INFO L124 PetriNetUnfolderBase]: 80345/117742 cut-off events. [2025-01-09 16:23:38,773 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-01-09 16:23:39,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221611 conditions, 117742 events. 80345/117742 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 3143. Compared 906625 event pairs, 69712 based on Foata normal form. 0/112988 useless extension candidates. Maximal degree in co-relation 221596. Up to 101391 conditions per place. [2025-01-09 16:23:39,442 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 44 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-01-09 16:23:39,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 292 flow [2025-01-09 16:23:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:23:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:23:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2025-01-09 16:23:39,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4767932489451477 [2025-01-09 16:23:39,444 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 182 flow. Second operand 6 states and 226 transitions. [2025-01-09 16:23:39,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 292 flow [2025-01-09 16:23:39,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 288 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:23:39,454 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 214 flow [2025-01-09 16:23:39,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2025-01-09 16:23:39,454 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 9 predicate places. [2025-01-09 16:23:39,454 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 214 flow [2025-01-09 16:23:39,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:39,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:39,455 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:39,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:39,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:39,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:23:39,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash 73092282, now seen corresponding path program 2 times [2025-01-09 16:23:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:39,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699352902] [2025-01-09 16:23:39,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:23:39,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:39,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-01-09 16:23:39,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 12 statements. [2025-01-09 16:23:39,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:23:39,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:23:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:23:39,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:23:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699352902] [2025-01-09 16:23:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699352902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:23:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:23:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:23:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309830843] [2025-01-09 16:23:39,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:23:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:23:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:23:39,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:23:39,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:23:39,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 79 [2025-01-09 16:23:39,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:23:39,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:23:39,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 79 [2025-01-09 16:23:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand