./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/weaver/parallel-misc-2.wvr.c -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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:15:17,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:15:17,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:15:17,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:15:17,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:15:18,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:15:18,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:15:18,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:15:18,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:15:18,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:15:18,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:15:18,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:15:18,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:15:18,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:15:18,022 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:15:18,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:15:18,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:15:18,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:15:18,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:15:18,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:15:18,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:15:18,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:15:18,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:15:18,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:15:18,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:15:18,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:15:18,025 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2025-02-08 01:15:18,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:15:18,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:15:18,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:15:18,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:15:18,277 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:15:18,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-02-08 01:15:19,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/062cb3152/639b75d549204b1395a9637a9c91e17b/FLAGe2024d4c4 [2025-02-08 01:15:19,691 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:15:19,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2025-02-08 01:15:19,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/062cb3152/639b75d549204b1395a9637a9c91e17b/FLAGe2024d4c4 [2025-02-08 01:15:20,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/062cb3152/639b75d549204b1395a9637a9c91e17b [2025-02-08 01:15:20,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:15:20,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:15:20,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:15:20,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:15:20,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:15:20,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f5ef82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20, skipping insertion in model container [2025-02-08 01:15:20,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:15:20,155 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/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-02-08 01:15:20,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:15:20,164 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:15:20,177 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/weaver/parallel-misc-2.wvr.c[2249,2262] [2025-02-08 01:15:20,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:15:20,188 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:15:20,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20 WrapperNode [2025-02-08 01:15:20,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:15:20,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:15:20,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:15:20,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:15:20,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,208 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-02-08 01:15:20,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:15:20,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:15:20,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:15:20,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:15:20,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,230 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-02-08 01:15:20,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:15:20,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:15:20,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:15:20,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:15:20,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (1/1) ... [2025-02-08 01:15:20,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:15:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:20,263 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-02-08 01:15:20,266 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-02-08 01:15:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:15:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:15:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:15:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:15:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:15:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:15:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:15:20,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:15:20,284 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:15:20,342 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:15:20,343 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:15:20,500 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:15:20,501 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:15:20,589 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:15:20,589 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:15:20,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:15:20 BoogieIcfgContainer [2025-02-08 01:15:20,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:15:20,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:15:20,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:15:20,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:15:20,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:15:20" (1/3) ... [2025-02-08 01:15:20,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7a6704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:15:20, skipping insertion in model container [2025-02-08 01:15:20,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:15:20" (2/3) ... [2025-02-08 01:15:20,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7a6704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:15:20, skipping insertion in model container [2025-02-08 01:15:20,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:15:20" (3/3) ... [2025-02-08 01:15:20,597 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-02-08 01:15:20,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:15:20,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-2.wvr.c that has 3 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:15:20,608 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:15:20,640 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:15:20,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2025-02-08 01:15:20,684 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-02-08 01:15:20,686 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:15:20,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-08 01:15:20,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2025-02-08 01:15:20,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2025-02-08 01:15:20,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:15:20,702 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;@4ef65bda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:15:20,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:15:20,710 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:15:20,710 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-02-08 01:15:20,710 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:15:20,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:20,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:20,711 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-02-08 01:15:20,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2018709473, now seen corresponding path program 1 times [2025-02-08 01:15:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936011324] [2025-02-08 01:15:20,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:20,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:15:20,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:15:20,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:20,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936011324] [2025-02-08 01:15:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936011324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:15:20,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083197401] [2025-02-08 01:15:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:15:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:15:21,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:15:21,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 01:15:21,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:21,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 01:15:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:21,126 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2025-02-08 01:15:21,129 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 01:15:21,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1138 event pairs, 12 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2025-02-08 01:15:21,133 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2025-02-08 01:15:21,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2025-02-08 01:15:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:15:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:15:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-08 01:15:21,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-02-08 01:15:21,144 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2025-02-08 01:15:21,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2025-02-08 01:15:21,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:15:21,151 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2025-02-08 01:15:21,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2025-02-08 01:15:21,157 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2025-02-08 01:15:21,157 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2025-02-08 01:15:21,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:21,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:21,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:21,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:15:21,158 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-02-08 01:15:21,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1608823839, now seen corresponding path program 1 times [2025-02-08 01:15:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899696225] [2025-02-08 01:15:21,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:21,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:15:21,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:15:21,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:21,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899696225] [2025-02-08 01:15:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899696225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145570812] [2025-02-08 01:15:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:21,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:21,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:21,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:21,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:21,412 INFO L124 PetriNetUnfolderBase]: 225/415 cut-off events. [2025-02-08 01:15:21,412 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-02-08 01:15:21,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 415 events. 225/415 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1872 event pairs, 26 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 322. Up to 182 conditions per place. [2025-02-08 01:15:21,415 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 45 selfloop transitions, 10 changer transitions 5/69 dead transitions. [2025-02-08 01:15:21,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 69 transitions, 326 flow [2025-02-08 01:15:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:15:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:15:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-02-08 01:15:21,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 01:15:21,418 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 110 transitions. [2025-02-08 01:15:21,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 69 transitions, 326 flow [2025-02-08 01:15:21,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:21,421 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2025-02-08 01:15:21,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2025-02-08 01:15:21,421 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-02-08 01:15:21,422 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2025-02-08 01:15:21,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:21,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:15:21,422 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-02-08 01:15:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1794885731, now seen corresponding path program 2 times [2025-02-08 01:15:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518275069] [2025-02-08 01:15:21,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:21,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-08 01:15:21,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 01:15:21,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:15:21,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518275069] [2025-02-08 01:15:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518275069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454770436] [2025-02-08 01:15:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:21,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:21,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:21,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:21,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:21,689 INFO L124 PetriNetUnfolderBase]: 213/424 cut-off events. [2025-02-08 01:15:21,689 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2025-02-08 01:15:21,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 424 events. 213/424 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1954 event pairs, 12 based on Foata normal form. 12/402 useless extension candidates. Maximal degree in co-relation 393. Up to 112 conditions per place. [2025-02-08 01:15:21,695 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 12 changer transitions 4/69 dead transitions. [2025-02-08 01:15:21,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 382 flow [2025-02-08 01:15:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:15:21,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:15:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-02-08 01:15:21,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-02-08 01:15:21,696 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 107 transitions. [2025-02-08 01:15:21,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 382 flow [2025-02-08 01:15:21,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:21,698 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2025-02-08 01:15:21,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2025-02-08 01:15:21,699 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2025-02-08 01:15:21,699 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2025-02-08 01:15:21,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:21,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:21,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:15:21,701 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-02-08 01:15:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1433237700, now seen corresponding path program 1 times [2025-02-08 01:15:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342543766] [2025-02-08 01:15:21,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:21,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:15:21,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:15:21,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342543766] [2025-02-08 01:15:21,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342543766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:21,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:21,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950402741] [2025-02-08 01:15:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:21,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:21,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:21,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:21,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:21,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:21,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:21,908 INFO L124 PetriNetUnfolderBase]: 212/413 cut-off events. [2025-02-08 01:15:21,908 INFO L125 PetriNetUnfolderBase]: For 644/644 co-relation queries the response was YES. [2025-02-08 01:15:21,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 413 events. 212/413 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1935 event pairs, 22 based on Foata normal form. 2/372 useless extension candidates. Maximal degree in co-relation 668. Up to 191 conditions per place. [2025-02-08 01:15:21,911 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2025-02-08 01:15:21,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 482 flow [2025-02-08 01:15:21,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:15:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:15:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-02-08 01:15:21,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-02-08 01:15:21,912 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 106 transitions. [2025-02-08 01:15:21,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 482 flow [2025-02-08 01:15:21,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 478 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:21,916 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2025-02-08 01:15:21,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-02-08 01:15:21,916 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2025-02-08 01:15:21,916 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2025-02-08 01:15:21,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:21,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:21,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:15:21,917 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-02-08 01:15:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1721589734, now seen corresponding path program 2 times [2025-02-08 01:15:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605373573] [2025-02-08 01:15:21,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:21,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-08 01:15:21,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 01:15:21,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:15:21,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605373573] [2025-02-08 01:15:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605373573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660226992] [2025-02-08 01:15:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:21,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:21,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:21,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:21,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:21,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:21,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:21,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:21,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,104 INFO L124 PetriNetUnfolderBase]: 201/418 cut-off events. [2025-02-08 01:15:22,104 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2025-02-08 01:15:22,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 418 events. 201/418 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1835 event pairs, 10 based on Foata normal form. 17/399 useless extension candidates. Maximal degree in co-relation 896. Up to 117 conditions per place. [2025-02-08 01:15:22,107 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 50 selfloop transitions, 12 changer transitions 1/72 dead transitions. [2025-02-08 01:15:22,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 534 flow [2025-02-08 01:15:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:15:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:15:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-08 01:15:22,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-02-08 01:15:22,108 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 103 transitions. [2025-02-08 01:15:22,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 534 flow [2025-02-08 01:15:22,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 518 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:22,112 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2025-02-08 01:15:22,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2025-02-08 01:15:22,113 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2025-02-08 01:15:22,113 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2025-02-08 01:15:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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-02-08 01:15:22,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:22,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:22,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:15:22,113 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-02-08 01:15:22,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:22,114 INFO L85 PathProgramCache]: Analyzing trace with hash 764564104, now seen corresponding path program 1 times [2025-02-08 01:15:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:22,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168644561] [2025-02-08 01:15:22,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:22,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:15:22,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:15:22,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:22,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:22,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168644561] [2025-02-08 01:15:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168644561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:15:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871857264] [2025-02-08 01:15:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:22,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:22,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:22,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:22,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2025-02-08 01:15:22,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-02-08 01:15:22,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:22,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2025-02-08 01:15:22,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,404 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2025-02-08 01:15:22,404 INFO L125 PetriNetUnfolderBase]: For 1446/1494 co-relation queries the response was YES. [2025-02-08 01:15:22,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1446/1494 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2391 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2025-02-08 01:15:22,408 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2025-02-08 01:15:22,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2025-02-08 01:15:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2025-02-08 01:15:22,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-02-08 01:15:22,409 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 123 transitions. [2025-02-08 01:15:22,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2025-02-08 01:15:22,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:22,413 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2025-02-08 01:15:22,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-02-08 01:15:22,413 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2025-02-08 01:15:22,413 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2025-02-08 01:15:22,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-02-08 01:15:22,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:22,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:22,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:15:22,414 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-02-08 01:15:22,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash -807870590, now seen corresponding path program 2 times [2025-02-08 01:15:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:22,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597547262] [2025-02-08 01:15:22,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:22,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:22,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:15:22,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:15:22,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:15:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597547262] [2025-02-08 01:15:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597547262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:22,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:15:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334082846] [2025-02-08 01:15:22,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:22,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:15:22,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:22,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:15:22,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:15:22,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:22,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:22,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:22,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:22,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:22,676 INFO L124 PetriNetUnfolderBase]: 448/876 cut-off events. [2025-02-08 01:15:22,676 INFO L125 PetriNetUnfolderBase]: For 2962/2962 co-relation queries the response was YES. [2025-02-08 01:15:22,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 876 events. 448/876 cut-off events. For 2962/2962 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4527 event pairs, 41 based on Foata normal form. 21/827 useless extension candidates. Maximal degree in co-relation 1341. Up to 287 conditions per place. [2025-02-08 01:15:22,683 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 74 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-02-08 01:15:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 919 flow [2025-02-08 01:15:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:15:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:15:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-08 01:15:22,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-02-08 01:15:22,684 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 103 transitions. [2025-02-08 01:15:22,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 919 flow [2025-02-08 01:15:22,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 906 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:22,690 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 560 flow [2025-02-08 01:15:22,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-02-08 01:15:22,690 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2025-02-08 01:15:22,690 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 560 flow [2025-02-08 01:15:22,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:15:22,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:22,691 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:22,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:15:22,691 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-02-08 01:15:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1165055944, now seen corresponding path program 3 times [2025-02-08 01:15:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:22,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105552123] [2025-02-08 01:15:22,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:22,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-02-08 01:15:22,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-02-08 01:15:22,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:15:22,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105552123] [2025-02-08 01:15:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105552123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623642908] [2025-02-08 01:15:22,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:22,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:22,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:22,826 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-02-08 01:15:22,828 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-02-08 01:15:22,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-02-08 01:15:22,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-02-08 01:15:22,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:15:22,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:22,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:15:22,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:23,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:15:23,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623642908] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:23,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 01:15:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686223029] [2025-02-08 01:15:23,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:23,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:15:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:23,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:15:23,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:15:23,316 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:23,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 560 flow. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 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-02-08 01:15:23,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:23,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:23,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:23,661 INFO L124 PetriNetUnfolderBase]: 704/1384 cut-off events. [2025-02-08 01:15:23,661 INFO L125 PetriNetUnfolderBase]: For 4942/4942 co-relation queries the response was YES. [2025-02-08 01:15:23,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 1384 events. 704/1384 cut-off events. For 4942/4942 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7557 event pairs, 49 based on Foata normal form. 18/1296 useless extension candidates. Maximal degree in co-relation 2189. Up to 398 conditions per place. [2025-02-08 01:15:23,670 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 98 selfloop transitions, 25 changer transitions 0/132 dead transitions. [2025-02-08 01:15:23,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 1299 flow [2025-02-08 01:15:23,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:15:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:15:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions. [2025-02-08 01:15:23,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.603125 [2025-02-08 01:15:23,671 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 560 flow. Second operand 10 states and 193 transitions. [2025-02-08 01:15:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 1299 flow [2025-02-08 01:15:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 132 transitions, 1294 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:23,679 INFO L231 Difference]: Finished difference. Result has 79 places, 77 transitions, 821 flow [2025-02-08 01:15:23,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=821, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2025-02-08 01:15:23,679 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2025-02-08 01:15:23,680 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 821 flow [2025-02-08 01:15:23,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 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-02-08 01:15:23,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:23,680 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:23,687 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-02-08 01:15:23,880 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-02-08 01:15:23,881 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-02-08 01:15:23,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1619010421, now seen corresponding path program 4 times [2025-02-08 01:15:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728068003] [2025-02-08 01:15:23,885 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:23,891 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:23,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:23,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728068003] [2025-02-08 01:15:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728068003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062674544] [2025-02-08 01:15:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:23,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:23,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:23,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:23,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02-08 01:15:23,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:23,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:23,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:24,212 INFO L124 PetriNetUnfolderBase]: 1216/2463 cut-off events. [2025-02-08 01:15:24,212 INFO L125 PetriNetUnfolderBase]: For 13081/13165 co-relation queries the response was YES. [2025-02-08 01:15:24,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 2463 events. 1216/2463 cut-off events. For 13081/13165 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15998 event pairs, 362 based on Foata normal form. 20/2221 useless extension candidates. Maximal degree in co-relation 9538. Up to 742 conditions per place. [2025-02-08 01:15:24,224 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 103 selfloop transitions, 26 changer transitions 0/152 dead transitions. [2025-02-08 01:15:24,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 152 transitions, 1964 flow [2025-02-08 01:15:24,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:15:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:15:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-08 01:15:24,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2025-02-08 01:15:24,225 INFO L175 Difference]: Start difference. First operand has 79 places, 77 transitions, 821 flow. Second operand 4 states and 93 transitions. [2025-02-08 01:15:24,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 152 transitions, 1964 flow [2025-02-08 01:15:24,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 1930 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-02-08 01:15:24,240 INFO L231 Difference]: Finished difference. Result has 83 places, 101 transitions, 1324 flow [2025-02-08 01:15:24,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1324, PETRI_PLACES=83, PETRI_TRANSITIONS=101} [2025-02-08 01:15:24,240 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-02-08 01:15:24,240 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 101 transitions, 1324 flow [2025-02-08 01:15:24,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02-08 01:15:24,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:24,241 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:15:24,241 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-02-08 01:15:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1197251132, now seen corresponding path program 1 times [2025-02-08 01:15:24,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:24,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400832349] [2025-02-08 01:15:24,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:24,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:24,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:15:24,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:24,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:24,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:24,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:24,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400832349] [2025-02-08 01:15:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400832349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:24,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180180470] [2025-02-08 01:15:24,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:24,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:24,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:24,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:24,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:24,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:24,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 101 transitions, 1324 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-02-08 01:15:24,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:24,686 INFO L124 PetriNetUnfolderBase]: 1910/3802 cut-off events. [2025-02-08 01:15:24,687 INFO L125 PetriNetUnfolderBase]: For 33218/33391 co-relation queries the response was YES. [2025-02-08 01:15:24,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17982 conditions, 3802 events. 1910/3802 cut-off events. For 33218/33391 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 28393 event pairs, 411 based on Foata normal form. 49/3656 useless extension candidates. Maximal degree in co-relation 17020. Up to 1466 conditions per place. [2025-02-08 01:15:24,712 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 133 selfloop transitions, 24 changer transitions 0/181 dead transitions. [2025-02-08 01:15:24,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 181 transitions, 2848 flow [2025-02-08 01:15:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:15:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:15:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-02-08 01:15:24,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-08 01:15:24,713 INFO L175 Difference]: Start difference. First operand has 83 places, 101 transitions, 1324 flow. Second operand 4 states and 84 transitions. [2025-02-08 01:15:24,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 181 transitions, 2848 flow [2025-02-08 01:15:24,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 181 transitions, 2831 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:15:24,746 INFO L231 Difference]: Finished difference. Result has 88 places, 113 transitions, 1549 flow [2025-02-08 01:15:24,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1549, PETRI_PLACES=88, PETRI_TRANSITIONS=113} [2025-02-08 01:15:24,747 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2025-02-08 01:15:24,747 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 1549 flow [2025-02-08 01:15:24,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-02-08 01:15:24,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:24,748 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:24,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:15:24,748 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-02-08 01:15:24,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1773551751, now seen corresponding path program 1 times [2025-02-08 01:15:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087613263] [2025-02-08 01:15:24,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:24,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:15:24,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:24,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:24,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:15:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087613263] [2025-02-08 01:15:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087613263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:15:24,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:15:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:15:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904829382] [2025-02-08 01:15:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:15:24,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:15:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:24,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:15:24,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:15:24,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:24,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 1549 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02-08 01:15:24,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:24,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:24,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:25,182 INFO L124 PetriNetUnfolderBase]: 1449/3087 cut-off events. [2025-02-08 01:15:25,182 INFO L125 PetriNetUnfolderBase]: For 27781/27881 co-relation queries the response was YES. [2025-02-08 01:15:25,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15589 conditions, 3087 events. 1449/3087 cut-off events. For 27781/27881 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 22417 event pairs, 425 based on Foata normal form. 82/3107 useless extension candidates. Maximal degree in co-relation 14879. Up to 985 conditions per place. [2025-02-08 01:15:25,205 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 106 selfloop transitions, 26 changer transitions 0/157 dead transitions. [2025-02-08 01:15:25,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 157 transitions, 2271 flow [2025-02-08 01:15:25,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:15:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:15:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-02-08 01:15:25,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 01:15:25,207 INFO L175 Difference]: Start difference. First operand has 88 places, 113 transitions, 1549 flow. Second operand 4 states and 88 transitions. [2025-02-08 01:15:25,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 157 transitions, 2271 flow [2025-02-08 01:15:25,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 157 transitions, 2271 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:25,233 INFO L231 Difference]: Finished difference. Result has 93 places, 106 transitions, 1487 flow [2025-02-08 01:15:25,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=93, PETRI_TRANSITIONS=106} [2025-02-08 01:15:25,235 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2025-02-08 01:15:25,235 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 106 transitions, 1487 flow [2025-02-08 01:15:25,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02-08 01:15:25,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:25,235 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:25,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:15:25,235 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-02-08 01:15:25,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1929269694, now seen corresponding path program 1 times [2025-02-08 01:15:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622104282] [2025-02-08 01:15:25,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:25,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:15:25,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:25,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:25,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622104282] [2025-02-08 01:15:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622104282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722538423] [2025-02-08 01:15:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:15:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:25,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:25,375 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-02-08 01:15:25,383 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-02-08 01:15:25,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 01:15:25,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:25,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:15:25,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:25,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:15:25,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:25,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722538423] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:25,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:25,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 01:15:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40822700] [2025-02-08 01:15:25,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:25,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:25,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:25,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:25,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 01:15:25,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 106 transitions, 1487 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:25,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:25,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 01:15:25,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:26,152 INFO L124 PetriNetUnfolderBase]: 2159/4876 cut-off events. [2025-02-08 01:15:26,153 INFO L125 PetriNetUnfolderBase]: For 58293/58551 co-relation queries the response was YES. [2025-02-08 01:15:26,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26338 conditions, 4876 events. 2159/4876 cut-off events. For 58293/58551 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 39860 event pairs, 470 based on Foata normal form. 70/4780 useless extension candidates. Maximal degree in co-relation 24861. Up to 1588 conditions per place. [2025-02-08 01:15:26,185 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 214 selfloop transitions, 24 changer transitions 1/268 dead transitions. [2025-02-08 01:15:26,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 268 transitions, 4483 flow [2025-02-08 01:15:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-02-08 01:15:26,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-02-08 01:15:26,186 INFO L175 Difference]: Start difference. First operand has 93 places, 106 transitions, 1487 flow. Second operand 6 states and 147 transitions. [2025-02-08 01:15:26,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 268 transitions, 4483 flow [2025-02-08 01:15:26,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 268 transitions, 4483 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:26,241 INFO L231 Difference]: Finished difference. Result has 99 places, 121 transitions, 1621 flow [2025-02-08 01:15:26,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1621, PETRI_PLACES=99, PETRI_TRANSITIONS=121} [2025-02-08 01:15:26,242 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2025-02-08 01:15:26,242 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 121 transitions, 1621 flow [2025-02-08 01:15:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:26,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:26,242 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:26,249 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-02-08 01:15:26,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:26,443 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-02-08 01:15:26,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 290544982, now seen corresponding path program 2 times [2025-02-08 01:15:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542859400] [2025-02-08 01:15:26,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:26,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:26,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:26,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:26,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:26,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:26,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542859400] [2025-02-08 01:15:26,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542859400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:26,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102156453] [2025-02-08 01:15:26,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:15:26,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:26,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:26,601 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-02-08 01:15:26,605 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-02-08 01:15:26,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:26,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:26,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:15:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:26,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 01:15:26,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:26,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:26,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102156453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:26,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:26,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 01:15:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706145447] [2025-02-08 01:15:26,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:26,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:26,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:26,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:26,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:26,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 01:15:26,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 121 transitions, 1621 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:26,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:26,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 01:15:26,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:27,439 INFO L124 PetriNetUnfolderBase]: 2735/6264 cut-off events. [2025-02-08 01:15:27,439 INFO L125 PetriNetUnfolderBase]: For 78448/78961 co-relation queries the response was YES. [2025-02-08 01:15:27,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35586 conditions, 6264 events. 2735/6264 cut-off events. For 78448/78961 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 54113 event pairs, 581 based on Foata normal form. 131/6248 useless extension candidates. Maximal degree in co-relation 33442. Up to 2611 conditions per place. [2025-02-08 01:15:27,472 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 213 selfloop transitions, 28 changer transitions 1/271 dead transitions. [2025-02-08 01:15:27,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 271 transitions, 4446 flow [2025-02-08 01:15:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-08 01:15:27,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-02-08 01:15:27,476 INFO L175 Difference]: Start difference. First operand has 99 places, 121 transitions, 1621 flow. Second operand 6 states and 145 transitions. [2025-02-08 01:15:27,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 271 transitions, 4446 flow [2025-02-08 01:15:27,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 271 transitions, 4390 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:27,539 INFO L231 Difference]: Finished difference. Result has 107 places, 138 transitions, 1798 flow [2025-02-08 01:15:27,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1798, PETRI_PLACES=107, PETRI_TRANSITIONS=138} [2025-02-08 01:15:27,539 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2025-02-08 01:15:27,540 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 138 transitions, 1798 flow [2025-02-08 01:15:27,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:27,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:27,540 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:27,546 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-02-08 01:15:27,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:27,745 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-02-08 01:15:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash -451519456, now seen corresponding path program 3 times [2025-02-08 01:15:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387231321] [2025-02-08 01:15:27,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:27,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:27,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:27,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:15:27,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387231321] [2025-02-08 01:15:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387231321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901506374] [2025-02-08 01:15:27,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:15:27,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:27,872 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-02-08 01:15:27,880 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-02-08 01:15:27,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:27,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:27,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:15:27,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:27,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:15:27,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:27,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:28,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901506374] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:28,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 01:15:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622931741] [2025-02-08 01:15:28,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:28,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:28,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:28,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:28,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 01:15:28,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 138 transitions, 1798 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:28,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:28,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 01:15:28,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:29,019 INFO L124 PetriNetUnfolderBase]: 3511/8012 cut-off events. [2025-02-08 01:15:29,020 INFO L125 PetriNetUnfolderBase]: For 103902/104516 co-relation queries the response was YES. [2025-02-08 01:15:29,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46364 conditions, 8012 events. 3511/8012 cut-off events. For 103902/104516 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 72206 event pairs, 669 based on Foata normal form. 149/7967 useless extension candidates. Maximal degree in co-relation 43802. Up to 3484 conditions per place. [2025-02-08 01:15:29,083 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 240 selfloop transitions, 38 changer transitions 1/308 dead transitions. [2025-02-08 01:15:29,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 308 transitions, 4986 flow [2025-02-08 01:15:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-02-08 01:15:29,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2025-02-08 01:15:29,085 INFO L175 Difference]: Start difference. First operand has 107 places, 138 transitions, 1798 flow. Second operand 6 states and 147 transitions. [2025-02-08 01:15:29,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 308 transitions, 4986 flow [2025-02-08 01:15:29,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 308 transitions, 4970 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:29,304 INFO L231 Difference]: Finished difference. Result has 115 places, 161 transitions, 2100 flow [2025-02-08 01:15:29,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2100, PETRI_PLACES=115, PETRI_TRANSITIONS=161} [2025-02-08 01:15:29,305 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2025-02-08 01:15:29,305 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 161 transitions, 2100 flow [2025-02-08 01:15:29,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:29,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:29,306 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:29,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:15:29,506 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,SelfDestructingSolverStorable13 [2025-02-08 01:15:29,507 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-02-08 01:15:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1949367432, now seen corresponding path program 4 times [2025-02-08 01:15:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:29,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760869220] [2025-02-08 01:15:29,508 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:29,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:29,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:29,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:29,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:29,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760869220] [2025-02-08 01:15:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760869220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626125586] [2025-02-08 01:15:29,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:15:29,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:29,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:29,646 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-02-08 01:15:29,647 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-02-08 01:15:29,678 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 01:15:29,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 01:15:29,691 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:15:29,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:29,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 01:15:29,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:29,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626125586] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:29,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:29,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 01:15:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297141230] [2025-02-08 01:15:29,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:29,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:15:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:29,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:15:29,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:15:29,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2025-02-08 01:15:29,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 161 transitions, 2100 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:29,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:29,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2025-02-08 01:15:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:30,786 INFO L124 PetriNetUnfolderBase]: 3768/8707 cut-off events. [2025-02-08 01:15:30,786 INFO L125 PetriNetUnfolderBase]: For 116272/117051 co-relation queries the response was YES. [2025-02-08 01:15:30,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52097 conditions, 8707 events. 3768/8707 cut-off events. For 116272/117051 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 80056 event pairs, 755 based on Foata normal form. 194/8727 useless extension candidates. Maximal degree in co-relation 49219. Up to 4402 conditions per place. [2025-02-08 01:15:30,956 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 246 selfloop transitions, 33 changer transitions 1/309 dead transitions. [2025-02-08 01:15:30,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 309 transitions, 5035 flow [2025-02-08 01:15:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:15:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:15:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-02-08 01:15:30,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2025-02-08 01:15:30,957 INFO L175 Difference]: Start difference. First operand has 115 places, 161 transitions, 2100 flow. Second operand 6 states and 145 transitions. [2025-02-08 01:15:30,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 309 transitions, 5035 flow [2025-02-08 01:15:31,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 309 transitions, 5003 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-02-08 01:15:31,098 INFO L231 Difference]: Finished difference. Result has 123 places, 176 transitions, 2343 flow [2025-02-08 01:15:31,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2343, PETRI_PLACES=123, PETRI_TRANSITIONS=176} [2025-02-08 01:15:31,100 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 91 predicate places. [2025-02-08 01:15:31,100 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 176 transitions, 2343 flow [2025-02-08 01:15:31,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-02-08 01:15:31,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:15:31,100 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:15:31,107 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-02-08 01:15:31,300 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,SelfDestructingSolverStorable14 [2025-02-08 01:15:31,301 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-02-08 01:15:31,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:15:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash 323228678, now seen corresponding path program 5 times [2025-02-08 01:15:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:15:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518870529] [2025-02-08 01:15:31,301 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:15:31,308 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-02-08 01:15:31,320 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 01:15:31,320 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 01:15:31,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:15:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518870529] [2025-02-08 01:15:31,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518870529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:15:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819365982] [2025-02-08 01:15:31,416 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:15:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:15:31,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:15:31,418 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-02-08 01:15:31,421 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-02-08 01:15:31,449 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-02-08 01:15:31,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 01:15:31,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 01:15:31,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:15:31,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 01:15:31,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:15:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:31,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:15:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:15:32,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819365982] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:15:32,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:15:32,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 20 [2025-02-08 01:15:32,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706591784] [2025-02-08 01:15:32,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:15:32,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:15:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:15:32,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:15:32,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:15:32,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2025-02-08 01:15:32,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 176 transitions, 2343 flow. Second operand has 20 states, 20 states have (on average 14.5) internal successors, (290), 20 states have internal predecessors, (290), 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-02-08 01:15:32,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:15:32,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2025-02-08 01:15:32,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:15:36,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:15:39,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:15:48,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:15:54,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:15:59,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:16:06,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse0 (mod .cse9 4294967296)) (.cse1 (mod .cse9 2)) (.cse7 (mod c_~i1~0 4294967296))) (let ((.cse4 (mod (+ 2 c_~i2~0) 4294967296)) (.cse3 (< .cse0 (+ .cse1 .cse7 1))) (.cse8 (* (mod c_~N~0 2147483648) 2)) (.cse2 (mod c_~i2~0 4294967296))) (and (or (< .cse0 (+ .cse1 .cse2 1)) .cse3) (or (< .cse0 (+ .cse1 .cse4 1)) .cse3) (let ((.cse5 (mod (+ c_~i1~0 2) 4294967296)) (.cse6 (mod c_~i1~0 2))) (or (< .cse5 (+ .cse0 .cse6 1)) (< .cse5 (+ .cse6 .cse4 1)))) (< .cse7 .cse8) (or (< .cse0 (+ .cse1 1 (mod (+ c_~i2~0 1) 4294967296))) .cse3) (< .cse0 .cse8) (not (= (+ (* (div c_~N~0 2147483648) 4294967296) .cse2 1) (* c_~N~0 2))))))) is different from false [2025-02-08 01:16:07,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:16:08,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:16:13,557 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse0 (mod .cse9 4294967296)) (.cse1 (mod .cse9 2)) (.cse7 (mod c_~i1~0 4294967296))) (let ((.cse4 (mod (+ 2 c_~i2~0) 4294967296)) (.cse3 (< .cse0 (+ .cse1 .cse7 1))) (.cse8 (* (mod c_~N~0 2147483648) 2)) (.cse2 (mod c_~i2~0 4294967296))) (and (or (< .cse0 (+ .cse1 .cse2 1)) .cse3) (or (< .cse0 (+ .cse1 .cse4 1)) .cse3) (let ((.cse5 (mod (+ c_~i1~0 2) 4294967296)) (.cse6 (mod c_~i1~0 2))) (or (< .cse5 (+ .cse0 .cse6 1)) (< .cse5 (+ .cse6 .cse4 1)))) (< .cse7 .cse8) (or (< .cse0 (+ .cse1 1 (mod (+ c_~i2~0 1) 4294967296))) .cse3) (< .cse0 .cse8) (<= (+ (* (div c_~N~0 2147483648) 4294967296) .cse2 2) (* c_~N~0 2)))))) is different from false [2025-02-08 01:16:17,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:16:21,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-08 01:16:41,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []