./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longer-2.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/triangular-longer-2.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 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:22:02,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:22:02,455 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:22:02,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:22:02,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:22:02,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:22:02,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:22:02,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:22:02,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:22:02,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:22:02,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:22:02,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:22:02,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:22:02,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:22:02,473 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:22:02,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:22:02,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:22:02,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:22:02,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:22:02,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:22:02,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:22:02,475 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 -> 647bb9f2bc4e44b8324ce986a0773d034e56e6ec110a9fd5233f5c8c0dbbeb10 [2025-01-09 16:22:02,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:22:02,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:22:02,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:22:02,821 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:22:02,821 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:22:02,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-2.i [2025-01-09 16:22:04,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0422a64ac/7f82c823e8ff4f95b8f7ad84365a1ec3/FLAGe1777cd7c [2025-01-09 16:22:04,446 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:22:04,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-2.i [2025-01-09 16:22:04,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0422a64ac/7f82c823e8ff4f95b8f7ad84365a1ec3/FLAGe1777cd7c [2025-01-09 16:22:04,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0422a64ac/7f82c823e8ff4f95b8f7ad84365a1ec3 [2025-01-09 16:22:04,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:22:04,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:22:04,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:22:04,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:22:04,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:22:04,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8bc1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04, skipping insertion in model container [2025-01-09 16:22:04,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:22:04,845 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/triangular-longer-2.i[30963,30976] [2025-01-09 16:22:04,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:22:04,857 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:22:04,885 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/triangular-longer-2.i[30963,30976] [2025-01-09 16:22:04,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:22:04,907 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:22:04,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04 WrapperNode [2025-01-09 16:22:04,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:22:04,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:22:04,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:22:04,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:22:04,912 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:22:04" (1/1) ... [2025-01-09 16:22:04,920 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:22:04" (1/1) ... [2025-01-09 16:22:04,929 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-01-09 16:22:04,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:22:04,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:22:04,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:22:04,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:22:04,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,948 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:22:04,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:22:04,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:22:04,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:22:04,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:22:04,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (1/1) ... [2025-01-09 16:22:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:22:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:04,987 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:22:04,995 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:22:05,015 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:22:05,016 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:22:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:22:05,016 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:22:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:22:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:22:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:22:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:22:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:22:05,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:22:05,018 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:22:05,119 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:22:05,120 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:22:05,202 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:22:05,202 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:22:05,283 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:22:05,283 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:22:05,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:05 BoogieIcfgContainer [2025-01-09 16:22:05,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:22:05,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:22:05,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:22:05,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:22:05,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:22:04" (1/3) ... [2025-01-09 16:22:05,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abf5928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:05, skipping insertion in model container [2025-01-09 16:22:05,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:22:04" (2/3) ... [2025-01-09 16:22:05,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abf5928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:22:05, skipping insertion in model container [2025-01-09 16:22:05,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:05" (3/3) ... [2025-01-09 16:22:05,292 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-01-09 16:22:05,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:22:05,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:22:05,308 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:22:05,354 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:22:05,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 56 flow [2025-01-09 16:22:05,409 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-01-09 16:22:05,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:22:05,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-01-09 16:22:05,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 56 flow [2025-01-09 16:22:05,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 50 flow [2025-01-09 16:22:05,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:22:05,450 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;@7e170636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:22:05,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:22:05,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:22:05,461 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-01-09 16:22:05,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:22:05,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:05,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:05,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:05,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -60315798, now seen corresponding path program 1 times [2025-01-09 16:22:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008768408] [2025-01-09 16:22:05,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:05,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:22:05,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:22:05,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:05,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:05,842 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:22:05,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:05,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008768408] [2025-01-09 16:22:05,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008768408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:05,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:05,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:22:05,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577288590] [2025-01-09 16:22:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:05,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:22:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:05,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:22:05,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:22:05,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:05,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:22:05,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:05,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:05,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:06,191 INFO L124 PetriNetUnfolderBase]: 385/644 cut-off events. [2025-01-09 16:22:06,192 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:22:06,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 644 events. 385/644 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2643 event pairs, 57 based on Foata normal form. 15/640 useless extension candidates. Maximal degree in co-relation 1248. Up to 303 conditions per place. [2025-01-09 16:22:06,199 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 29 selfloop transitions, 7 changer transitions 31/70 dead transitions. [2025-01-09 16:22:06,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 70 transitions, 283 flow [2025-01-09 16:22:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:22:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:22:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-01-09 16:22:06,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-09 16:22:06,214 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 8 states and 111 transitions. [2025-01-09 16:22:06,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 70 transitions, 283 flow [2025-01-09 16:22:06,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 70 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:22:06,222 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 97 flow [2025-01-09 16:22:06,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-01-09 16:22:06,228 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2025-01-09 16:22:06,228 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 97 flow [2025-01-09 16:22:06,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:22:06,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:06,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:22:06,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1860061967, now seen corresponding path program 1 times [2025-01-09 16:22:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109476334] [2025-01-09 16:22:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:06,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:22:06,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:22:06,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:06,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:06,399 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:22:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109476334] [2025-01-09 16:22:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109476334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:06,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:06,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:22:06,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263631786] [2025-01-09 16:22:06,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:06,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:22:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:06,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:22:06,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:22:06,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:06,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:06,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:06,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:06,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:06,567 INFO L124 PetriNetUnfolderBase]: 247/442 cut-off events. [2025-01-09 16:22:06,568 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2025-01-09 16:22:06,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 442 events. 247/442 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1745 event pairs, 63 based on Foata normal form. 18/454 useless extension candidates. Maximal degree in co-relation 1154. Up to 190 conditions per place. [2025-01-09 16:22:06,573 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 27 selfloop transitions, 8 changer transitions 15/53 dead transitions. [2025-01-09 16:22:06,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 291 flow [2025-01-09 16:22:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:22:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:22:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2025-01-09 16:22:06,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2025-01-09 16:22:06,574 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 97 flow. Second operand 6 states and 76 transitions. [2025-01-09 16:22:06,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 291 flow [2025-01-09 16:22:06,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 287 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:22:06,580 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 141 flow [2025-01-09 16:22:06,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-01-09 16:22:06,582 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2025-01-09 16:22:06,582 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 141 flow [2025-01-09 16:22:06,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:06,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:06,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:06,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:22:06,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:06,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:06,584 INFO L85 PathProgramCache]: Analyzing trace with hash -39912258, now seen corresponding path program 1 times [2025-01-09 16:22:06,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:06,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903060367] [2025-01-09 16:22:06,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:06,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:06,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:22:06,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:22:06,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:06,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:06,728 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:22:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:06,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903060367] [2025-01-09 16:22:06,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903060367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:06,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:06,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:22:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560254581] [2025-01-09 16:22:06,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:06,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:22:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:06,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:22:06,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:22:06,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:06,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:06,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:06,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:06,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:06,910 INFO L124 PetriNetUnfolderBase]: 391/707 cut-off events. [2025-01-09 16:22:06,911 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2025-01-09 16:22:06,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2112 conditions, 707 events. 391/707 cut-off events. For 1142/1142 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3016 event pairs, 95 based on Foata normal form. 27/730 useless extension candidates. Maximal degree in co-relation 2092. Up to 264 conditions per place. [2025-01-09 16:22:06,914 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 47 selfloop transitions, 11 changer transitions 20/81 dead transitions. [2025-01-09 16:22:06,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 515 flow [2025-01-09 16:22:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:22:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:22:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-01-09 16:22:06,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-09 16:22:06,916 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 141 flow. Second operand 9 states and 117 transitions. [2025-01-09 16:22:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 515 flow [2025-01-09 16:22:06,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 81 transitions, 473 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-01-09 16:22:06,921 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 237 flow [2025-01-09 16:22:06,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-01-09 16:22:06,922 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-01-09 16:22:06,922 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 237 flow [2025-01-09 16:22:06,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:06,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:06,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:06,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:22:06,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:06,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -908019650, now seen corresponding path program 2 times [2025-01-09 16:22:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:06,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292020778] [2025-01-09 16:22:06,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:06,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:22:06,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:22:06,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:22:06,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:07,031 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:22:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292020778] [2025-01-09 16:22:07,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292020778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:07,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:07,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:22:07,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046503062] [2025-01-09 16:22:07,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:07,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:22:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:07,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:22:07,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:22:07,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:07,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:07,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:07,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:07,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:07,197 INFO L124 PetriNetUnfolderBase]: 328/602 cut-off events. [2025-01-09 16:22:07,197 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2025-01-09 16:22:07,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 602 events. 328/602 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2494 event pairs, 95 based on Foata normal form. 45/643 useless extension candidates. Maximal degree in co-relation 2014. Up to 234 conditions per place. [2025-01-09 16:22:07,200 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 11 changer transitions 28/80 dead transitions. [2025-01-09 16:22:07,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 609 flow [2025-01-09 16:22:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:22:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:22:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-01-09 16:22:07,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2025-01-09 16:22:07,202 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 237 flow. Second operand 8 states and 103 transitions. [2025-01-09 16:22:07,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 609 flow [2025-01-09 16:22:07,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 565 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-01-09 16:22:07,207 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 268 flow [2025-01-09 16:22:07,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2025-01-09 16:22:07,208 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-01-09 16:22:07,208 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 268 flow [2025-01-09 16:22:07,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:07,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:07,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:07,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:22:07,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:07,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1362561663, now seen corresponding path program 1 times [2025-01-09 16:22:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:07,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947577744] [2025-01-09 16:22:07,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:07,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:22:07,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:22:07,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:07,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:07,352 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:22:07,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:07,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947577744] [2025-01-09 16:22:07,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947577744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:07,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:07,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:22:07,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36408051] [2025-01-09 16:22:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:22:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:07,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:22:07,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:22:07,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:07,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:07,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:07,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:07,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:07,715 INFO L124 PetriNetUnfolderBase]: 364/661 cut-off events. [2025-01-09 16:22:07,716 INFO L125 PetriNetUnfolderBase]: For 2964/2964 co-relation queries the response was YES. [2025-01-09 16:22:07,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 661 events. 364/661 cut-off events. For 2964/2964 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2731 event pairs, 65 based on Foata normal form. 27/682 useless extension candidates. Maximal degree in co-relation 2384. Up to 148 conditions per place. [2025-01-09 16:22:07,720 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 40 selfloop transitions, 18 changer transitions 28/89 dead transitions. [2025-01-09 16:22:07,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 712 flow [2025-01-09 16:22:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:22:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:22:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-01-09 16:22:07,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-01-09 16:22:07,721 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 268 flow. Second operand 10 states and 125 transitions. [2025-01-09 16:22:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 712 flow [2025-01-09 16:22:07,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 643 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-01-09 16:22:07,727 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 347 flow [2025-01-09 16:22:07,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=347, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2025-01-09 16:22:07,728 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-01-09 16:22:07,728 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 347 flow [2025-01-09 16:22:07,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:07,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:07,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:07,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:22:07,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:07,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1243656831, now seen corresponding path program 2 times [2025-01-09 16:22:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:07,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308330828] [2025-01-09 16:22:07,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:07,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:22:07,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:22:07,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:22:07,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:07,821 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:22:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308330828] [2025-01-09 16:22:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308330828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:22:07,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108221818] [2025-01-09 16:22:07,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:07,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:22:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:07,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:22:07,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:22:07,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:07,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:07,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:07,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:07,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:08,081 INFO L124 PetriNetUnfolderBase]: 391/710 cut-off events. [2025-01-09 16:22:08,081 INFO L125 PetriNetUnfolderBase]: For 3901/3901 co-relation queries the response was YES. [2025-01-09 16:22:08,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 710 events. 391/710 cut-off events. For 3901/3901 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3055 event pairs, 104 based on Foata normal form. 18/724 useless extension candidates. Maximal degree in co-relation 2758. Up to 327 conditions per place. [2025-01-09 16:22:08,086 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 49 selfloop transitions, 16 changer transitions 25/93 dead transitions. [2025-01-09 16:22:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 797 flow [2025-01-09 16:22:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:22:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:22:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-01-09 16:22:08,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-01-09 16:22:08,087 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 347 flow. Second operand 11 states and 135 transitions. [2025-01-09 16:22:08,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 797 flow [2025-01-09 16:22:08,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 717 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-01-09 16:22:08,095 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 378 flow [2025-01-09 16:22:08,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=378, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-01-09 16:22:08,095 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 40 predicate places. [2025-01-09 16:22:08,096 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 378 flow [2025-01-09 16:22:08,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:08,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:08,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:08,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:22:08,096 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:08,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:08,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1992746150, now seen corresponding path program 1 times [2025-01-09 16:22:08,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:08,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686078563] [2025-01-09 16:22:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:08,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:08,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:08,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:08,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:08,184 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:22:08,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686078563] [2025-01-09 16:22:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686078563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:22:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746545576] [2025-01-09 16:22:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:22:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:22:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:22:08,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:08,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:22:08,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:08,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:08,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:08,378 INFO L124 PetriNetUnfolderBase]: 436/790 cut-off events. [2025-01-09 16:22:08,378 INFO L125 PetriNetUnfolderBase]: For 4629/4629 co-relation queries the response was YES. [2025-01-09 16:22:08,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3130 conditions, 790 events. 436/790 cut-off events. For 4629/4629 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3402 event pairs, 59 based on Foata normal form. 18/802 useless extension candidates. Maximal degree in co-relation 3096. Up to 154 conditions per place. [2025-01-09 16:22:08,383 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 44 selfloop transitions, 24 changer transitions 23/94 dead transitions. [2025-01-09 16:22:08,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 854 flow [2025-01-09 16:22:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:22:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:22:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-01-09 16:22:08,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2025-01-09 16:22:08,385 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 378 flow. Second operand 10 states and 125 transitions. [2025-01-09 16:22:08,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 854 flow [2025-01-09 16:22:08,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 795 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 16:22:08,394 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 453 flow [2025-01-09 16:22:08,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=453, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2025-01-09 16:22:08,395 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 44 predicate places. [2025-01-09 16:22:08,395 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 453 flow [2025-01-09 16:22:08,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:22:08,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:08,395 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:08,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:22:08,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash -544595345, now seen corresponding path program 1 times [2025-01-09 16:22:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:08,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846763300] [2025-01-09 16:22:08,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:08,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:08,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:08,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:08,486 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:22:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846763300] [2025-01-09 16:22:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846763300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118470602] [2025-01-09 16:22:08,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:08,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:08,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:08,498 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:22:08,499 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:22:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:08,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:08,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:08,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:08,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:22:08,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:08,653 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:22:08,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:08,843 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:22:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118470602] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:08,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 16:22:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318769024] [2025-01-09 16:22:08,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:08,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:22:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:08,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:22:08,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:22:08,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:08,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 453 flow. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:08,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:08,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:08,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:09,386 INFO L124 PetriNetUnfolderBase]: 580/1067 cut-off events. [2025-01-09 16:22:09,386 INFO L125 PetriNetUnfolderBase]: For 9680/9680 co-relation queries the response was YES. [2025-01-09 16:22:09,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4708 conditions, 1067 events. 580/1067 cut-off events. For 9680/9680 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4464 event pairs, 149 based on Foata normal form. 63/1126 useless extension candidates. Maximal degree in co-relation 4673. Up to 504 conditions per place. [2025-01-09 16:22:09,392 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 65 selfloop transitions, 17 changer transitions 67/152 dead transitions. [2025-01-09 16:22:09,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 152 transitions, 1517 flow [2025-01-09 16:22:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:22:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:22:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 231 transitions. [2025-01-09 16:22:09,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506578947368421 [2025-01-09 16:22:09,393 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 453 flow. Second operand 19 states and 231 transitions. [2025-01-09 16:22:09,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 152 transitions, 1517 flow [2025-01-09 16:22:09,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 152 transitions, 1425 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-01-09 16:22:09,405 INFO L231 Difference]: Finished difference. Result has 92 places, 52 transitions, 589 flow [2025-01-09 16:22:09,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=589, PETRI_PLACES=92, PETRI_TRANSITIONS=52} [2025-01-09 16:22:09,407 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 66 predicate places. [2025-01-09 16:22:09,407 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 52 transitions, 589 flow [2025-01-09 16:22:09,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:22:09,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:09,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:09,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:09,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:09,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2139163127, now seen corresponding path program 2 times [2025-01-09 16:22:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:09,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210961032] [2025-01-09 16:22:09,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:09,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:22:09,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:09,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:22:09,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:09,720 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:22:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210961032] [2025-01-09 16:22:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210961032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:22:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:22:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:22:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813270695] [2025-01-09 16:22:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:22:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:22:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:09,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:22:09,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:22:09,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:09,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 52 transitions, 589 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:22:09,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:09,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:10,109 INFO L124 PetriNetUnfolderBase]: 661/1234 cut-off events. [2025-01-09 16:22:10,109 INFO L125 PetriNetUnfolderBase]: For 23923/23923 co-relation queries the response was YES. [2025-01-09 16:22:10,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6679 conditions, 1234 events. 661/1234 cut-off events. For 23923/23923 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5757 event pairs, 144 based on Foata normal form. 27/1257 useless extension candidates. Maximal degree in co-relation 6633. Up to 501 conditions per place. [2025-01-09 16:22:10,118 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 77 selfloop transitions, 23 changer transitions 31/134 dead transitions. [2025-01-09 16:22:10,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 134 transitions, 1653 flow [2025-01-09 16:22:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:22:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:22:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 187 transitions. [2025-01-09 16:22:10,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194444444444445 [2025-01-09 16:22:10,120 INFO L175 Difference]: Start difference. First operand has 92 places, 52 transitions, 589 flow. Second operand 15 states and 187 transitions. [2025-01-09 16:22:10,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 134 transitions, 1653 flow [2025-01-09 16:22:10,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 134 transitions, 1285 flow, removed 173 selfloop flow, removed 12 redundant places. [2025-01-09 16:22:10,138 INFO L231 Difference]: Finished difference. Result has 94 places, 58 transitions, 639 flow [2025-01-09 16:22:10,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=639, PETRI_PLACES=94, PETRI_TRANSITIONS=58} [2025-01-09 16:22:10,139 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 68 predicate places. [2025-01-09 16:22:10,139 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 58 transitions, 639 flow [2025-01-09 16:22:10,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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:22:10,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:10,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:22:10,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash -592968961, now seen corresponding path program 3 times [2025-01-09 16:22:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319484305] [2025-01-09 16:22:10,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:10,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-01-09 16:22:10,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:10,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:22:10,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:10,225 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:22:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319484305] [2025-01-09 16:22:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319484305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153683097] [2025-01-09 16:22:10,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:10,227 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:22:10,229 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:22:10,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-01-09 16:22:10,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:22:10,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:22:10,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:10,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:22:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:10,309 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:22:10,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:10,392 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:22:10,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153683097] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:10,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:10,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 16:22:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012116326] [2025-01-09 16:22:10,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:10,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:22:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:10,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:22:10,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:22:10,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:10,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 58 transitions, 639 flow. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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:22:10,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:10,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:10,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:10,946 INFO L124 PetriNetUnfolderBase]: 964/1758 cut-off events. [2025-01-09 16:22:10,946 INFO L125 PetriNetUnfolderBase]: For 29525/29525 co-relation queries the response was YES. [2025-01-09 16:22:10,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 1758 events. 964/1758 cut-off events. For 29525/29525 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8845 event pairs, 96 based on Foata normal form. 81/1835 useless extension candidates. Maximal degree in co-relation 9066. Up to 278 conditions per place. [2025-01-09 16:22:10,956 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 85 selfloop transitions, 53 changer transitions 81/222 dead transitions. [2025-01-09 16:22:10,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 222 transitions, 2639 flow [2025-01-09 16:22:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 16:22:10,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-01-09 16:22:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 313 transitions. [2025-01-09 16:22:10,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5216666666666666 [2025-01-09 16:22:10,957 INFO L175 Difference]: Start difference. First operand has 94 places, 58 transitions, 639 flow. Second operand 25 states and 313 transitions. [2025-01-09 16:22:10,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 222 transitions, 2639 flow [2025-01-09 16:22:10,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 222 transitions, 2405 flow, removed 101 selfloop flow, removed 10 redundant places. [2025-01-09 16:22:10,990 INFO L231 Difference]: Finished difference. Result has 121 places, 79 transitions, 1099 flow [2025-01-09 16:22:10,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1099, PETRI_PLACES=121, PETRI_TRANSITIONS=79} [2025-01-09 16:22:10,991 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 95 predicate places. [2025-01-09 16:22:10,991 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 79 transitions, 1099 flow [2025-01-09 16:22:10,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 14 states have internal predecessors, (99), 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:22:10,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:10,992 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:10,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:22:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:11,193 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1819129439, now seen corresponding path program 1 times [2025-01-09 16:22:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363247100] [2025-01-09 16:22:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:11,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:22:11,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:22:11,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:11,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:22:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363247100] [2025-01-09 16:22:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363247100] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680984803] [2025-01-09 16:22:11,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:22:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:11,319 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:22:11,324 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:22:11,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:22:11,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:22:11,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:11,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:11,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:22:11,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:22:11,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:22:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680984803] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:11,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-09 16:22:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507403277] [2025-01-09 16:22:11,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 16:22:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:11,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 16:22:11,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:22:11,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:11,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 79 transitions, 1099 flow. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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:22:11,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:11,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:11,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:12,154 INFO L124 PetriNetUnfolderBase]: 1360/2540 cut-off events. [2025-01-09 16:22:12,154 INFO L125 PetriNetUnfolderBase]: For 83315/83315 co-relation queries the response was YES. [2025-01-09 16:22:12,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16132 conditions, 2540 events. 1360/2540 cut-off events. For 83315/83315 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 14181 event pairs, 70 based on Foata normal form. 72/2608 useless extension candidates. Maximal degree in co-relation 16073. Up to 458 conditions per place. [2025-01-09 16:22:12,172 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 92 selfloop transitions, 83 changer transitions 88/266 dead transitions. [2025-01-09 16:22:12,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 266 transitions, 4344 flow [2025-01-09 16:22:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 16:22:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 16:22:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 341 transitions. [2025-01-09 16:22:12,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074404761904762 [2025-01-09 16:22:12,174 INFO L175 Difference]: Start difference. First operand has 121 places, 79 transitions, 1099 flow. Second operand 28 states and 341 transitions. [2025-01-09 16:22:12,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 266 transitions, 4344 flow [2025-01-09 16:22:12,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 266 transitions, 3553 flow, removed 375 selfloop flow, removed 16 redundant places. [2025-01-09 16:22:12,270 INFO L231 Difference]: Finished difference. Result has 143 places, 115 transitions, 1849 flow [2025-01-09 16:22:12,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1849, PETRI_PLACES=143, PETRI_TRANSITIONS=115} [2025-01-09 16:22:12,275 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 117 predicate places. [2025-01-09 16:22:12,275 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 115 transitions, 1849 flow [2025-01-09 16:22:12,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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:22:12,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:12,275 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:12,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:22:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:12,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:12,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -949267911, now seen corresponding path program 2 times [2025-01-09 16:22:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:12,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120427057] [2025-01-09 16:22:12,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:12,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:22:12,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:22:12,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:12,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:12,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:22:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:12,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120427057] [2025-01-09 16:22:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120427057] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:12,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973169571] [2025-01-09 16:22:12,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:12,632 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:22:12,637 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:22:12,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:22:12,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:22:12,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:12,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:12,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:22:12,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:12,758 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:22:12,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:12,966 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:22:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973169571] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:12,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:12,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-01-09 16:22:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441898179] [2025-01-09 16:22:12,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:12,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:22:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:12,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:22:12,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:22:13,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:13,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 115 transitions, 1849 flow. Second operand has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 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:22:13,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:13,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:13,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:14,256 INFO L124 PetriNetUnfolderBase]: 1909/3558 cut-off events. [2025-01-09 16:22:14,257 INFO L125 PetriNetUnfolderBase]: For 204679/204679 co-relation queries the response was YES. [2025-01-09 16:22:14,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26643 conditions, 3558 events. 1909/3558 cut-off events. For 204679/204679 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 19273 event pairs, 44 based on Foata normal form. 99/3653 useless extension candidates. Maximal degree in co-relation 26573. Up to 698 conditions per place. [2025-01-09 16:22:14,284 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 132 selfloop transitions, 129 changer transitions 134/398 dead transitions. [2025-01-09 16:22:14,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 398 transitions, 7615 flow [2025-01-09 16:22:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 16:22:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-01-09 16:22:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 528 transitions. [2025-01-09 16:22:14,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116279069767442 [2025-01-09 16:22:14,286 INFO L175 Difference]: Start difference. First operand has 143 places, 115 transitions, 1849 flow. Second operand 43 states and 528 transitions. [2025-01-09 16:22:14,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 398 transitions, 7615 flow [2025-01-09 16:22:14,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 398 transitions, 5866 flow, removed 841 selfloop flow, removed 15 redundant places. [2025-01-09 16:22:14,430 INFO L231 Difference]: Finished difference. Result has 192 places, 155 transitions, 2815 flow [2025-01-09 16:22:14,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2815, PETRI_PLACES=192, PETRI_TRANSITIONS=155} [2025-01-09 16:22:14,430 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 166 predicate places. [2025-01-09 16:22:14,431 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 155 transitions, 2815 flow [2025-01-09 16:22:14,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.05) internal successors, (141), 20 states have internal predecessors, (141), 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:22:14,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:14,431 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:14,437 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:22:14,635 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,SelfDestructingSolverStorable11 [2025-01-09 16:22:14,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:14,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -464091197, now seen corresponding path program 3 times [2025-01-09 16:22:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021804440] [2025-01-09 16:22:14,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:14,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-01-09 16:22:14,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:22:14,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 16:22:14,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021804440] [2025-01-09 16:22:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021804440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236136211] [2025-01-09 16:22:14,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:14,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:14,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:14,848 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:22:14,856 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:22:14,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 7 equivalence classes. [2025-01-09 16:22:14,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 16:22:14,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 16:22:14,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:14,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 16:22:14,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:14,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236136211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:15,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2025-01-09 16:22:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765108923] [2025-01-09 16:22:15,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:15,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:22:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:15,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:22:15,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:22:15,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:15,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 155 transitions, 2815 flow. Second operand has 28 states, 28 states have (on average 7.107142857142857) internal successors, (199), 28 states have internal predecessors, (199), 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:22:15,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:15,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:15,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:16,854 INFO L124 PetriNetUnfolderBase]: 2503/4631 cut-off events. [2025-01-09 16:22:16,854 INFO L125 PetriNetUnfolderBase]: For 386588/386588 co-relation queries the response was YES. [2025-01-09 16:22:16,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38696 conditions, 4631 events. 2503/4631 cut-off events. For 386588/386588 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 24344 event pairs, 32 based on Foata normal form. 72/4699 useless extension candidates. Maximal degree in co-relation 38603. Up to 917 conditions per place. [2025-01-09 16:22:16,902 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 166 selfloop transitions, 173 changer transitions 133/475 dead transitions. [2025-01-09 16:22:16,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 475 transitions, 10115 flow [2025-01-09 16:22:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 16:22:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-01-09 16:22:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 611 transitions. [2025-01-09 16:22:16,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5091666666666667 [2025-01-09 16:22:16,904 INFO L175 Difference]: Start difference. First operand has 192 places, 155 transitions, 2815 flow. Second operand 50 states and 611 transitions. [2025-01-09 16:22:16,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 475 transitions, 10115 flow [2025-01-09 16:22:17,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 475 transitions, 7951 flow, removed 1056 selfloop flow, removed 22 redundant places. [2025-01-09 16:22:17,429 INFO L231 Difference]: Finished difference. Result has 230 places, 199 transitions, 3639 flow [2025-01-09 16:22:17,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2029, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=3639, PETRI_PLACES=230, PETRI_TRANSITIONS=199} [2025-01-09 16:22:17,429 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 204 predicate places. [2025-01-09 16:22:17,430 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 199 transitions, 3639 flow [2025-01-09 16:22:17,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.107142857142857) internal successors, (199), 28 states have internal predecessors, (199), 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:22:17,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:17,430 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:17,436 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:22:17,630 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,SelfDestructingSolverStorable12 [2025-01-09 16:22:17,631 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash -32963289, now seen corresponding path program 4 times [2025-01-09 16:22:17,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:17,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821459616] [2025-01-09 16:22:17,631 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:22:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:17,639 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-01-09 16:22:17,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:17,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:22:17,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821459616] [2025-01-09 16:22:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821459616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238677251] [2025-01-09 16:22:18,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:22:18,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:18,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:18,041 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:22:18,042 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:22:18,073 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-01-09 16:22:18,088 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:18,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:22:18,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:18,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:18,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:18,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238677251] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:18,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-01-09 16:22:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740400188] [2025-01-09 16:22:18,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:18,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 16:22:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:18,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 16:22:18,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1508, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 16:22:18,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:18,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 199 transitions, 3639 flow. Second operand has 45 states, 45 states have (on average 7.022222222222222) internal successors, (316), 45 states have internal predecessors, (316), 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:22:18,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:18,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:18,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:19,918 INFO L124 PetriNetUnfolderBase]: 2575/4870 cut-off events. [2025-01-09 16:22:19,919 INFO L125 PetriNetUnfolderBase]: For 464411/464411 co-relation queries the response was YES. [2025-01-09 16:22:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40240 conditions, 4870 events. 2575/4870 cut-off events. For 464411/464411 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 26967 event pairs, 1043 based on Foata normal form. 45/4911 useless extension candidates. Maximal degree in co-relation 40140. Up to 3684 conditions per place. [2025-01-09 16:22:19,971 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 254 selfloop transitions, 31 changer transitions 81/369 dead transitions. [2025-01-09 16:22:19,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 369 transitions, 7986 flow [2025-01-09 16:22:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:22:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:22:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 359 transitions. [2025-01-09 16:22:19,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4825268817204301 [2025-01-09 16:22:19,980 INFO L175 Difference]: Start difference. First operand has 230 places, 199 transitions, 3639 flow. Second operand 31 states and 359 transitions. [2025-01-09 16:22:19,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 369 transitions, 7986 flow [2025-01-09 16:22:20,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 369 transitions, 6722 flow, removed 591 selfloop flow, removed 18 redundant places. [2025-01-09 16:22:20,609 INFO L231 Difference]: Finished difference. Result has 253 places, 213 transitions, 3378 flow [2025-01-09 16:22:20,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2821, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3378, PETRI_PLACES=253, PETRI_TRANSITIONS=213} [2025-01-09 16:22:20,610 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 227 predicate places. [2025-01-09 16:22:20,610 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 213 transitions, 3378 flow [2025-01-09 16:22:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.022222222222222) internal successors, (316), 45 states have internal predecessors, (316), 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:22:20,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:20,611 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:20,617 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:22:20,815 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:22:20,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:20,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -359193539, now seen corresponding path program 5 times [2025-01-09 16:22:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046682190] [2025-01-09 16:22:20,816 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:22:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:20,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 12 equivalence classes. [2025-01-09 16:22:20,842 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:20,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-09 16:22:20,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046682190] [2025-01-09 16:22:21,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046682190] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700701041] [2025-01-09 16:22:21,173 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:22:21,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:21,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:21,176 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:22:21,177 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:22:21,206 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 66 statements into 12 equivalence classes. [2025-01-09 16:22:21,224 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:21,224 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-01-09 16:22:21,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:21,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:21,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:21,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700701041] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:21,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-01-09 16:22:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709289514] [2025-01-09 16:22:21,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 16:22:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:21,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 16:22:21,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1574, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 16:22:22,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:22,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 213 transitions, 3378 flow. Second operand has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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:22:22,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:22,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:24,091 INFO L124 PetriNetUnfolderBase]: 3151/6165 cut-off events. [2025-01-09 16:22:24,092 INFO L125 PetriNetUnfolderBase]: For 608083/608083 co-relation queries the response was YES. [2025-01-09 16:22:24,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50810 conditions, 6165 events. 3151/6165 cut-off events. For 608083/608083 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 36488 event pairs, 678 based on Foata normal form. 63/6224 useless extension candidates. Maximal degree in co-relation 50698. Up to 2656 conditions per place. [2025-01-09 16:22:24,153 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 282 selfloop transitions, 140 changer transitions 143/568 dead transitions. [2025-01-09 16:22:24,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 568 transitions, 11318 flow [2025-01-09 16:22:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 16:22:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-09 16:22:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 658 transitions. [2025-01-09 16:22:24,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48099415204678364 [2025-01-09 16:22:24,157 INFO L175 Difference]: Start difference. First operand has 253 places, 213 transitions, 3378 flow. Second operand 57 states and 658 transitions. [2025-01-09 16:22:24,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 568 transitions, 11318 flow [2025-01-09 16:22:25,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 568 transitions, 10762 flow, removed 261 selfloop flow, removed 16 redundant places. [2025-01-09 16:22:25,121 INFO L231 Difference]: Finished difference. Result has 315 places, 274 transitions, 4929 flow [2025-01-09 16:22:25,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3082, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=4929, PETRI_PLACES=315, PETRI_TRANSITIONS=274} [2025-01-09 16:22:25,122 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 289 predicate places. [2025-01-09 16:22:25,122 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 274 transitions, 4929 flow [2025-01-09 16:22:25,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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:22:25,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:25,123 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:25,129 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:22:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:25,328 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:25,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash 898999305, now seen corresponding path program 6 times [2025-01-09 16:22:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500903825] [2025-01-09 16:22:25,329 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:22:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:25,334 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 9 equivalence classes. [2025-01-09 16:22:25,345 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:25,347 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-01-09 16:22:25,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500903825] [2025-01-09 16:22:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500903825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:25,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064777339] [2025-01-09 16:22:25,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:22:25,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:25,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:25,698 INFO L229 MonitoredProcess]: Starting monitored process 9 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:22:25,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:22:25,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 66 statements into 9 equivalence classes. [2025-01-09 16:22:25,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:25,744 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-01-09 16:22:25,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:25,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:25,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:25,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064777339] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:26,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-09 16:22:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102925084] [2025-01-09 16:22:26,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 16:22:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 16:22:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 16:22:26,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:26,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 274 transitions, 4929 flow. Second operand has 46 states, 46 states have (on average 7.065217391304348) internal successors, (325), 46 states have internal predecessors, (325), 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:22:26,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:26,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:26,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:29,244 INFO L124 PetriNetUnfolderBase]: 3628/7260 cut-off events. [2025-01-09 16:22:29,244 INFO L125 PetriNetUnfolderBase]: For 904771/904771 co-relation queries the response was YES. [2025-01-09 16:22:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65411 conditions, 7260 events. 3628/7260 cut-off events. For 904771/904771 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 45109 event pairs, 422 based on Foata normal form. 63/7319 useless extension candidates. Maximal degree in co-relation 65277. Up to 1661 conditions per place. [2025-01-09 16:22:29,540 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 236 selfloop transitions, 244 changer transitions 143/626 dead transitions. [2025-01-09 16:22:29,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 626 transitions, 13706 flow [2025-01-09 16:22:29,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 16:22:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-09 16:22:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 664 transitions. [2025-01-09 16:22:29,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2025-01-09 16:22:29,542 INFO L175 Difference]: Start difference. First operand has 315 places, 274 transitions, 4929 flow. Second operand 57 states and 664 transitions. [2025-01-09 16:22:29,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 626 transitions, 13706 flow [2025-01-09 16:22:31,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 626 transitions, 12670 flow, removed 493 selfloop flow, removed 18 redundant places. [2025-01-09 16:22:31,247 INFO L231 Difference]: Finished difference. Result has 363 places, 331 transitions, 6405 flow [2025-01-09 16:22:31,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4341, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=6405, PETRI_PLACES=363, PETRI_TRANSITIONS=331} [2025-01-09 16:22:31,248 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 337 predicate places. [2025-01-09 16:22:31,248 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 331 transitions, 6405 flow [2025-01-09 16:22:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.065217391304348) internal successors, (325), 46 states have internal predecessors, (325), 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:22:31,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:31,248 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:31,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:31,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 16:22:31,449 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash -835951825, now seen corresponding path program 7 times [2025-01-09 16:22:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562029658] [2025-01-09 16:22:31,450 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:22:31,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:31,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 16:22:31,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:31,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:31,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562029658] [2025-01-09 16:22:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562029658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486939372] [2025-01-09 16:22:31,757 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:22:31,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:31,759 INFO L229 MonitoredProcess]: Starting monitored process 10 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:22:31,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:22:31,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 16:22:31,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:31,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:22:31,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:31,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:31,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:31,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:32,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486939372] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:32,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:32,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-01-09 16:22:32,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474525445] [2025-01-09 16:22:32,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:32,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 16:22:32,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:32,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 16:22:32,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1682, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 16:22:32,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:32,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 331 transitions, 6405 flow. Second operand has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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:22:32,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:32,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:34,830 INFO L124 PetriNetUnfolderBase]: 4060/8253 cut-off events. [2025-01-09 16:22:34,831 INFO L125 PetriNetUnfolderBase]: For 1233862/1233862 co-relation queries the response was YES. [2025-01-09 16:22:35,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79488 conditions, 8253 events. 4060/8253 cut-off events. For 1233862/1233862 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 53339 event pairs, 302 based on Foata normal form. 63/8312 useless extension candidates. Maximal degree in co-relation 79344. Up to 1931 conditions per place. [2025-01-09 16:22:35,035 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 224 selfloop transitions, 309 changer transitions 143/679 dead transitions. [2025-01-09 16:22:35,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 679 transitions, 15824 flow [2025-01-09 16:22:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 16:22:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-09 16:22:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 670 transitions. [2025-01-09 16:22:35,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.489766081871345 [2025-01-09 16:22:35,037 INFO L175 Difference]: Start difference. First operand has 363 places, 331 transitions, 6405 flow. Second operand 57 states and 670 transitions. [2025-01-09 16:22:35,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 679 transitions, 15824 flow [2025-01-09 16:22:38,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 679 transitions, 14212 flow, removed 754 selfloop flow, removed 19 redundant places. [2025-01-09 16:22:38,567 INFO L231 Difference]: Finished difference. Result has 408 places, 381 transitions, 7709 flow [2025-01-09 16:22:38,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5573, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=7709, PETRI_PLACES=408, PETRI_TRANSITIONS=381} [2025-01-09 16:22:38,568 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 382 predicate places. [2025-01-09 16:22:38,568 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 381 transitions, 7709 flow [2025-01-09 16:22:38,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.044444444444444) internal successors, (317), 45 states have internal predecessors, (317), 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:22:38,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:38,569 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:38,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:38,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:38,773 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:38,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 375235133, now seen corresponding path program 8 times [2025-01-09 16:22:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:38,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882915126] [2025-01-09 16:22:38,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:38,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-09 16:22:38,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:38,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:38,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882915126] [2025-01-09 16:22:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882915126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732974920] [2025-01-09 16:22:39,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:22:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:39,052 INFO L229 MonitoredProcess]: Starting monitored process 11 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:22:39,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:22:39,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-01-09 16:22:39,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:39,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:22:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:39,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:39,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:39,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:39,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732974920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:39,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-09 16:22:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186903186] [2025-01-09 16:22:39,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 16:22:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 16:22:39,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1787, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 16:22:39,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:39,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 381 transitions, 7709 flow. Second operand has 46 states, 46 states have (on average 7.065217391304348) internal successors, (325), 46 states have internal predecessors, (325), 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:22:39,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:39,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:39,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:42,638 INFO L124 PetriNetUnfolderBase]: 4429/9078 cut-off events. [2025-01-09 16:22:42,638 INFO L125 PetriNetUnfolderBase]: For 1469519/1469519 co-relation queries the response was YES. [2025-01-09 16:22:42,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90155 conditions, 9078 events. 4429/9078 cut-off events. For 1469519/1469519 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 60403 event pairs, 200 based on Foata normal form. 63/9137 useless extension candidates. Maximal degree in co-relation 90002. Up to 2147 conditions per place. [2025-01-09 16:22:43,004 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 213 selfloop transitions, 364 changer transitions 143/723 dead transitions. [2025-01-09 16:22:43,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 723 transitions, 17323 flow [2025-01-09 16:22:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 16:22:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-09 16:22:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 676 transitions. [2025-01-09 16:22:43,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2025-01-09 16:22:43,006 INFO L175 Difference]: Start difference. First operand has 408 places, 381 transitions, 7709 flow. Second operand 57 states and 676 transitions. [2025-01-09 16:22:43,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 723 transitions, 17323 flow [2025-01-09 16:22:46,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 723 transitions, 15374 flow, removed 851 selfloop flow, removed 25 redundant places. [2025-01-09 16:22:46,073 INFO L231 Difference]: Finished difference. Result has 448 places, 422 transitions, 8795 flow [2025-01-09 16:22:46,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6686, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8795, PETRI_PLACES=448, PETRI_TRANSITIONS=422} [2025-01-09 16:22:46,074 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 422 predicate places. [2025-01-09 16:22:46,074 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 422 transitions, 8795 flow [2025-01-09 16:22:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.065217391304348) internal successors, (325), 46 states have internal predecessors, (325), 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:22:46,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:46,075 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:46,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:46,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 16:22:46,279 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:46,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1136790283, now seen corresponding path program 9 times [2025-01-09 16:22:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906301503] [2025-01-09 16:22:46,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:46,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 8 equivalence classes. [2025-01-09 16:22:46,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:46,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 16:22:46,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:46,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906301503] [2025-01-09 16:22:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906301503] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197139954] [2025-01-09 16:22:46,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:22:46,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:46,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:46,670 INFO L229 MonitoredProcess]: Starting monitored process 12 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:22:46,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 16:22:46,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 8 equivalence classes. [2025-01-09 16:22:46,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:46,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-01-09 16:22:46,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:46,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 16:22:46,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:46,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:47,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197139954] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:47,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2025-01-09 16:22:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095960410] [2025-01-09 16:22:47,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:47,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 16:22:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:47,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 16:22:47,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 16:22:47,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:47,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 422 transitions, 8795 flow. Second operand has 45 states, 45 states have (on average 7.022222222222222) internal successors, (316), 45 states have internal predecessors, (316), 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:22:47,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:47,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:47,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:50,179 INFO L124 PetriNetUnfolderBase]: 4780/9810 cut-off events. [2025-01-09 16:22:50,179 INFO L125 PetriNetUnfolderBase]: For 1641683/1641683 co-relation queries the response was YES. [2025-01-09 16:22:50,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98611 conditions, 9810 events. 4780/9810 cut-off events. For 1641683/1641683 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 66320 event pairs, 134 based on Foata normal form. 63/9869 useless extension candidates. Maximal degree in co-relation 98448. Up to 2321 conditions per place. [2025-01-09 16:22:50,302 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 208 selfloop transitions, 407 changer transitions 143/761 dead transitions. [2025-01-09 16:22:50,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 761 transitions, 18476 flow [2025-01-09 16:22:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 16:22:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-01-09 16:22:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 682 transitions. [2025-01-09 16:22:50,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49853801169590645 [2025-01-09 16:22:50,304 INFO L175 Difference]: Start difference. First operand has 448 places, 422 transitions, 8795 flow. Second operand 57 states and 682 transitions. [2025-01-09 16:22:50,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 761 transitions, 18476 flow [2025-01-09 16:22:54,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 761 transitions, 16469 flow, removed 827 selfloop flow, removed 31 redundant places. [2025-01-09 16:22:54,360 INFO L231 Difference]: Finished difference. Result has 484 places, 457 transitions, 9818 flow [2025-01-09 16:22:54,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7694, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=9818, PETRI_PLACES=484, PETRI_TRANSITIONS=457} [2025-01-09 16:22:54,361 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 458 predicate places. [2025-01-09 16:22:54,361 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 457 transitions, 9818 flow [2025-01-09 16:22:54,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 7.022222222222222) internal successors, (316), 45 states have internal predecessors, (316), 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:22:54,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:22:54,361 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:22:54,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 16:22:54,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:54,562 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:22:54,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:22:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1390799983, now seen corresponding path program 10 times [2025-01-09 16:22:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:22:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625525891] [2025-01-09 16:22:54,563 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:22:54,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:22:54,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-01-09 16:22:54,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:54,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:22:54,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:22:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625525891] [2025-01-09 16:22:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625525891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:22:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060009769] [2025-01-09 16:22:54,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:22:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:22:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:22:54,893 INFO L229 MonitoredProcess]: Starting monitored process 13 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:22:54,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 16:22:54,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 66 statements into 2 equivalence classes. [2025-01-09 16:22:54,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 16:22:54,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:22:54,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:22:54,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:22:54,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:22:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:55,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:22:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:22:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060009769] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:22:55,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:22:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-01-09 16:22:55,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783811499] [2025-01-09 16:22:55,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:22:55,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 16:22:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:22:55,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 16:22:55,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1688, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 16:22:55,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:22:55,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 457 transitions, 9818 flow. Second operand has 46 states, 46 states have (on average 7.043478260869565) internal successors, (324), 46 states have internal predecessors, (324), 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:22:55,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:22:55,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:22:55,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:22:58,743 INFO L124 PetriNetUnfolderBase]: 5041/10317 cut-off events. [2025-01-09 16:22:58,744 INFO L125 PetriNetUnfolderBase]: For 1806681/1806681 co-relation queries the response was YES. [2025-01-09 16:22:58,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106318 conditions, 10317 events. 5041/10317 cut-off events. For 1806681/1806681 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 70215 event pairs, 96 based on Foata normal form. 72/10385 useless extension candidates. Maximal degree in co-relation 106143. Up to 2429 conditions per place. [2025-01-09 16:22:58,905 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 207 selfloop transitions, 436 changer transitions 148/794 dead transitions. [2025-01-09 16:22:58,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 794 transitions, 20094 flow [2025-01-09 16:22:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 16:22:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-01-09 16:22:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 701 transitions. [2025-01-09 16:22:58,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035919540229885 [2025-01-09 16:22:58,907 INFO L175 Difference]: Start difference. First operand has 484 places, 457 transitions, 9818 flow. Second operand 58 states and 701 transitions. [2025-01-09 16:22:58,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 794 transitions, 20094 flow [2025-01-09 16:23:03,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 794 transitions, 17891 flow, removed 854 selfloop flow, removed 38 redundant places. [2025-01-09 16:23:03,358 INFO L231 Difference]: Finished difference. Result has 514 places, 479 transitions, 10758 flow [2025-01-09 16:23:03,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=8567, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=416, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=10758, PETRI_PLACES=514, PETRI_TRANSITIONS=479} [2025-01-09 16:23:03,359 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 488 predicate places. [2025-01-09 16:23:03,359 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 479 transitions, 10758 flow [2025-01-09 16:23:03,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 7.043478260869565) internal successors, (324), 46 states have internal predecessors, (324), 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:03,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:23:03,359 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:23:03,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 16:23:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:23:03,560 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:23:03,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:23:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash 145946268, now seen corresponding path program 11 times [2025-01-09 16:23:03,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:23:03,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937884925] [2025-01-09 16:23:03,562 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:23:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:23:03,565 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 9 equivalence classes. [2025-01-09 16:23:03,569 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 16:23:03,569 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-01-09 16:23:03,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:03,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:23:03,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 16:23:03,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 16:23:03,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:23:03,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:23:03,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:23:03,595 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:23:03,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-09 16:23:03,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-09 16:23:03,597 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-09 16:23:03,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:23:03,598 INFO L422 BasicCegarLoop]: Path program histogram: [11, 3, 2, 2, 1, 1, 1] [2025-01-09 16:23:03,653 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:23:03,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:23:03,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:23:03 BasicIcfg [2025-01-09 16:23:03,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:23:03,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:23:03,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:23:03,657 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:23:03,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:22:05" (3/4) ... [2025-01-09 16:23:03,658 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:23:03,709 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-01-09 16:23:03,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:23:03,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:23:03,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:23:03,746 INFO L158 Benchmark]: Toolchain (without parser) took 59124.04ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 111.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-09 16:23:03,746 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:23:03,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.77ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 92.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:23:03,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.44ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:23:03,747 INFO L158 Benchmark]: Boogie Preprocessor took 28.57ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:23:03,747 INFO L158 Benchmark]: RCFGBuilder took 324.70ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 72.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:23:03,747 INFO L158 Benchmark]: TraceAbstraction took 58371.53ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 72.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-01-09 16:23:03,747 INFO L158 Benchmark]: Witness Printer took 88.42ms. Allocated memory is still 3.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:23:03,748 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.77ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 92.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.44ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.57ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.70ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 72.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 58371.53ms. Allocated memory was 142.6MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 72.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 88.42ms. Allocated memory is still 3.0GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-2, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=3, id1=-2, id2=-1, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=7, id1=-2, id2=-1, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-2, id2=-1, j=26, k=9, k=9] - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 34 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 58.2s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 45.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8604 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8587 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9852 IncrementalHoareTripleChecker+Invalid, 10276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 12 mSDtfsCounter, 9852 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1938 GetRequests, 996 SyntacticMatches, 7 SemanticMatches, 935 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21375 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10758occurred in iteration=20, InterpolantAutomatonStates: 616, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1374 NumberOfCodeBlocks, 1374 NumberOfCodeBlocksAsserted, 115 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 8746 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1703 ConjunctsInSsa, 240 ConjunctsInUnsatCore, 44 InterpolantComputations, 8 PerfectInterpolantSequences, 4/3108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:23:03,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE