./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.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/bench-exp2x9.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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:11:27,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:11:27,127 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:11:27,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:11:27,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:11:27,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:11:27,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:11:27,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:11:27,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:11:27,169 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:11:27,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:11:27,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:11:27,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:11:27,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:11:27,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:11:27,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:11:27,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:11:27,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:11:27,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:27,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:11:27,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:11:27,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:11:27,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:11:27,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:11:27,175 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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2025-02-08 01:11:27,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:11:27,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:11:27,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:11:27,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:11:27,457 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:11:27,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-02-08 01:11:28,732 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bf663b5f/1586d8f87d3f4eeb829d15198defdf00/FLAG869a082fe [2025-02-08 01:11:29,026 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:11:29,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-02-08 01:11:29,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bf663b5f/1586d8f87d3f4eeb829d15198defdf00/FLAG869a082fe [2025-02-08 01:11:29,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bf663b5f/1586d8f87d3f4eeb829d15198defdf00 [2025-02-08 01:11:29,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:11:29,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:11:29,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:29,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:11:29,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:11:29,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3085f6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29, skipping insertion in model container [2025-02-08 01:11:29,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:11:29,288 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/bench-exp2x9.wvr.c[2721,2734] [2025-02-08 01:11:29,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:29,307 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:11:29,326 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/bench-exp2x9.wvr.c[2721,2734] [2025-02-08 01:11:29,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:11:29,338 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:11:29,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29 WrapperNode [2025-02-08 01:11:29,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:11:29,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:29,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:11:29,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:11:29,347 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:11:29" (1/1) ... [2025-02-08 01:11:29,354 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:11:29" (1/1) ... [2025-02-08 01:11:29,371 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-02-08 01:11:29,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:11:29,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:11:29,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:11:29,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:11:29,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,397 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:11:29,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:11:29,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:11:29,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:11:29,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:11:29,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (1/1) ... [2025-02-08 01:11:29,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:11:29,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:29,433 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:11:29,435 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:11:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:11:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:11:29,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:11:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:11:29,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:11:29,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:11:29,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:11:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-08 01:11:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-08 01:11:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:11:29,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:11:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:11:29,458 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:11:29,533 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:11:29,535 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:11:29,768 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:11:29,768 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:11:29,912 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:11:29,913 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:11:29,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:29 BoogieIcfgContainer [2025-02-08 01:11:29,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:11:29,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:11:29,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:11:29,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:11:29,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:11:29" (1/3) ... [2025-02-08 01:11:29,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163725dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:29, skipping insertion in model container [2025-02-08 01:11:29,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:11:29" (2/3) ... [2025-02-08 01:11:29,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163725dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:11:29, skipping insertion in model container [2025-02-08 01:11:29,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:11:29" (3/3) ... [2025-02-08 01:11:29,924 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-02-08 01:11:29,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:11:29,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-08 01:11:29,939 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:11:29,992 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 01:11:30,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-02-08 01:11:30,061 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-02-08 01:11:30,067 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:11:30,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 17 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-08 01:11:30,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-02-08 01:11:30,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2025-02-08 01:11:30,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:11:30,091 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;@bbcd659, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:11:30,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:11:30,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:11:30,104 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-08 01:11:30,104 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:11:30,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:30,105 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] [2025-02-08 01:11:30,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1981698874, now seen corresponding path program 1 times [2025-02-08 01:11:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504070495] [2025-02-08 01:11:30,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:30,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 01:11:30,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 01:11:30,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:30,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:30,634 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:11:30,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504070495] [2025-02-08 01:11:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504070495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:11:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806940221] [2025-02-08 01:11:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:30,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:11:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:30,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:11:30,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:11:30,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:30,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:11:30,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:30,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:30,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:31,024 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-02-08 01:11:31,025 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-02-08 01:11:31,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5577 event pairs, 123 based on Foata normal form. 1/998 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-02-08 01:11:31,050 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-02-08 01:11:31,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-02-08 01:11:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:11:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:11:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-02-08 01:11:31,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-02-08 01:11:31,066 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2025-02-08 01:11:31,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-02-08 01:11:31,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 01:11:31,079 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-02-08 01:11:31,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-02-08 01:11:31,087 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-02-08 01:11:31,088 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-02-08 01:11:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:11:31,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:31,089 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:11:31,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:11:31,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash -443921750, now seen corresponding path program 1 times [2025-02-08 01:11:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:31,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223118437] [2025-02-08 01:11:31,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:31,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:31,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:31,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:31,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:31,286 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:11:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:31,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223118437] [2025-02-08 01:11:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223118437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:31,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:11:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177229677] [2025-02-08 01:11:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:11:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:31,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:11:31,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:11:31,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:31,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:31,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:31,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:31,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:31,631 INFO L124 PetriNetUnfolderBase]: 1581/2026 cut-off events. [2025-02-08 01:11:31,632 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2025-02-08 01:11:31,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5032 conditions, 2026 events. 1581/2026 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7009 event pairs, 95 based on Foata normal form. 46/2068 useless extension candidates. Maximal degree in co-relation 1272. Up to 830 conditions per place. [2025-02-08 01:11:31,647 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-02-08 01:11:31,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 80 transitions, 387 flow [2025-02-08 01:11:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-02-08 01:11:31,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-02-08 01:11:31,649 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 114 transitions. [2025-02-08 01:11:31,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 80 transitions, 387 flow [2025-02-08 01:11:31,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 80 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:31,651 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-02-08 01:11:31,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-02-08 01:11:31,652 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-02-08 01:11:31,652 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-02-08 01:11:31,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:31,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:31,653 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:11:31,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:11:31,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:31,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash 534470690, now seen corresponding path program 1 times [2025-02-08 01:11:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:31,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141279641] [2025-02-08 01:11:31,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:31,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:31,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:31,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:31,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:31,782 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:11:31,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:31,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141279641] [2025-02-08 01:11:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141279641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:31,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252954060] [2025-02-08 01:11:31,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:31,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:31,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:31,788 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:11:31,790 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:11:31,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:31,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:31,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:31,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:31,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 01:11:31,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:32,052 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:11:32,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:32,125 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:11:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252954060] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:32,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:32,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 01:11:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148431744] [2025-02-08 01:11:32,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:32,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:32,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:32,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:32,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:32,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:11:32,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:32,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:32,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:32,471 INFO L124 PetriNetUnfolderBase]: 1907/2535 cut-off events. [2025-02-08 01:11:32,472 INFO L125 PetriNetUnfolderBase]: For 3316/3318 co-relation queries the response was YES. [2025-02-08 01:11:32,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7850 conditions, 2535 events. 1907/2535 cut-off events. For 3316/3318 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10059 event pairs, 284 based on Foata normal form. 64/2575 useless extension candidates. Maximal degree in co-relation 3599. Up to 1049 conditions per place. [2025-02-08 01:11:32,510 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-02-08 01:11:32,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 92 transitions, 571 flow [2025-02-08 01:11:32,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-02-08 01:11:32,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-08 01:11:32,512 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 108 transitions. [2025-02-08 01:11:32,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 92 transitions, 571 flow [2025-02-08 01:11:32,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:11:32,516 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2025-02-08 01:11:32,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-02-08 01:11:32,517 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-02-08 01:11:32,517 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2025-02-08 01:11:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:11:32,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:32,518 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:11:32,526 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:11:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:32,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:32,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1151452328, now seen corresponding path program 2 times [2025-02-08 01:11:32,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555519015] [2025-02-08 01:11:32,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:32,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:11:32,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:32,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:32,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:32,867 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:11:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555519015] [2025-02-08 01:11:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555519015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:11:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209948753] [2025-02-08 01:11:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:11:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:32,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:11:32,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:11:32,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:32,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:32,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:32,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:33,159 INFO L124 PetriNetUnfolderBase]: 1720/2266 cut-off events. [2025-02-08 01:11:33,159 INFO L125 PetriNetUnfolderBase]: For 4001/4003 co-relation queries the response was YES. [2025-02-08 01:11:33,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8307 conditions, 2266 events. 1720/2266 cut-off events. For 4001/4003 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8370 event pairs, 90 based on Foata normal form. 31/2273 useless extension candidates. Maximal degree in co-relation 4789. Up to 929 conditions per place. [2025-02-08 01:11:33,175 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 80 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2025-02-08 01:11:33,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 96 transitions, 649 flow [2025-02-08 01:11:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-02-08 01:11:33,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-02-08 01:11:33,180 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 107 transitions. [2025-02-08 01:11:33,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 96 transitions, 649 flow [2025-02-08 01:11:33,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:11:33,194 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 271 flow [2025-02-08 01:11:33,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-02-08 01:11:33,195 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2025-02-08 01:11:33,196 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 271 flow [2025-02-08 01:11:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:33,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:33,197 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:11:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:11:33,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:33,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:33,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1870126864, now seen corresponding path program 1 times [2025-02-08 01:11:33,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513471840] [2025-02-08 01:11:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:33,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:33,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:33,297 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:11:33,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:33,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513471840] [2025-02-08 01:11:33,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513471840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:33,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:33,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:11:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190749455] [2025-02-08 01:11:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:33,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:11:33,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:33,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:11:33,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:11:33,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:33,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:33,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:33,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:33,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:33,594 INFO L124 PetriNetUnfolderBase]: 1687/2233 cut-off events. [2025-02-08 01:11:33,594 INFO L125 PetriNetUnfolderBase]: For 4846/4848 co-relation queries the response was YES. [2025-02-08 01:11:33,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8827 conditions, 2233 events. 1687/2233 cut-off events. For 4846/4848 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8356 event pairs, 70 based on Foata normal form. 33/2242 useless extension candidates. Maximal degree in co-relation 4969. Up to 1030 conditions per place. [2025-02-08 01:11:33,613 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 78 selfloop transitions, 8 changer transitions 2/93 dead transitions. [2025-02-08 01:11:33,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 658 flow [2025-02-08 01:11:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-02-08 01:11:33,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-08 01:11:33,615 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 271 flow. Second operand 5 states and 105 transitions. [2025-02-08 01:11:33,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 658 flow [2025-02-08 01:11:33,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 647 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:33,623 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 274 flow [2025-02-08 01:11:33,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-02-08 01:11:33,624 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2025-02-08 01:11:33,624 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 274 flow [2025-02-08 01:11:33,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:33,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:33,625 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:11:33,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:11:33,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:33,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 14687998, now seen corresponding path program 2 times [2025-02-08 01:11:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800042723] [2025-02-08 01:11:33,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:33,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:11:33,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:33,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:33,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:33,724 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:11:33,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:33,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800042723] [2025-02-08 01:11:33,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800042723] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:33,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834080939] [2025-02-08 01:11:33,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:33,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:33,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:33,728 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:11:33,729 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:11:33,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:11:33,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:33,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:33,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:33,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 01:11:33,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:33,959 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:11:33,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:34,034 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:11:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834080939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:34,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:34,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 01:11:34,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542694027] [2025-02-08 01:11:34,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:34,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:34,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:34,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:34,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:34,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:34,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:11:34,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:34,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:34,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:34,316 INFO L124 PetriNetUnfolderBase]: 1625/2183 cut-off events. [2025-02-08 01:11:34,317 INFO L125 PetriNetUnfolderBase]: For 5166/5168 co-relation queries the response was YES. [2025-02-08 01:11:34,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8871 conditions, 2183 events. 1625/2183 cut-off events. For 5166/5168 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8567 event pairs, 257 based on Foata normal form. 62/2221 useless extension candidates. Maximal degree in co-relation 5087. Up to 1178 conditions per place. [2025-02-08 01:11:34,336 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-02-08 01:11:34,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 92 transitions, 678 flow [2025-02-08 01:11:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-02-08 01:11:34,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-02-08 01:11:34,339 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 274 flow. Second operand 5 states and 103 transitions. [2025-02-08 01:11:34,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 92 transitions, 678 flow [2025-02-08 01:11:34,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 665 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:34,345 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 314 flow [2025-02-08 01:11:34,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-02-08 01:11:34,346 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2025-02-08 01:11:34,346 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 314 flow [2025-02-08 01:11:34,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:11:34,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:34,347 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:11:34,355 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:11:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:34,548 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:34,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2105297128, now seen corresponding path program 1 times [2025-02-08 01:11:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327746035] [2025-02-08 01:11:34,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:34,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:34,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:34,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:34,619 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:11:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327746035] [2025-02-08 01:11:34,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327746035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085362533] [2025-02-08 01:11:34,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:34,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:34,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:34,622 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:11:34,630 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:11:34,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:11:34,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:34,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:34,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:34,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 01:11:34,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:34,779 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:11:34,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:34,821 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:11:34,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085362533] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:34,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:34,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 01:11:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230279985] [2025-02-08 01:11:34,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:34,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:34,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:34,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:34,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:34,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:11:34,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:34,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:35,130 INFO L124 PetriNetUnfolderBase]: 1745/2388 cut-off events. [2025-02-08 01:11:35,131 INFO L125 PetriNetUnfolderBase]: For 6713/6713 co-relation queries the response was YES. [2025-02-08 01:11:35,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10389 conditions, 2388 events. 1745/2388 cut-off events. For 6713/6713 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10198 event pairs, 349 based on Foata normal form. 80/2460 useless extension candidates. Maximal degree in co-relation 9127. Up to 1174 conditions per place. [2025-02-08 01:11:35,157 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 115 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2025-02-08 01:11:35,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 130 transitions, 1072 flow [2025-02-08 01:11:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-02-08 01:11:35,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7375 [2025-02-08 01:11:35,159 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 314 flow. Second operand 5 states and 118 transitions. [2025-02-08 01:11:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 130 transitions, 1072 flow [2025-02-08 01:11:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 130 transitions, 1014 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-02-08 01:11:35,169 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 350 flow [2025-02-08 01:11:35,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=350, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-02-08 01:11:35,170 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-02-08 01:11:35,170 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 350 flow [2025-02-08 01:11:35,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:11:35,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:35,171 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:11:35,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:11:35,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:35,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:35,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1763735232, now seen corresponding path program 2 times [2025-02-08 01:11:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:35,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856682865] [2025-02-08 01:11:35,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:35,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:35,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:11:35,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:35,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:35,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:35,452 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:11:35,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:35,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856682865] [2025-02-08 01:11:35,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856682865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:11:35,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:11:35,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:11:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56844718] [2025-02-08 01:11:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:11:35,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:11:35,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:35,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:11:35,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:11:35,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:35,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:35,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:35,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:35,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:35,705 INFO L124 PetriNetUnfolderBase]: 1515/2042 cut-off events. [2025-02-08 01:11:35,705 INFO L125 PetriNetUnfolderBase]: For 6691/6691 co-relation queries the response was YES. [2025-02-08 01:11:35,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9388 conditions, 2042 events. 1515/2042 cut-off events. For 6691/6691 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8158 event pairs, 89 based on Foata normal form. 34/2074 useless extension candidates. Maximal degree in co-relation 8358. Up to 864 conditions per place. [2025-02-08 01:11:35,718 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 108 selfloop transitions, 9 changer transitions 4/126 dead transitions. [2025-02-08 01:11:35,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 126 transitions, 1023 flow [2025-02-08 01:11:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-02-08 01:11:35,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-02-08 01:11:35,720 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 350 flow. Second operand 5 states and 114 transitions. [2025-02-08 01:11:35,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 126 transitions, 1023 flow [2025-02-08 01:11:35,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 1014 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:35,731 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 354 flow [2025-02-08 01:11:35,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-02-08 01:11:35,732 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2025-02-08 01:11:35,732 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 354 flow [2025-02-08 01:11:35,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:11:35,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:35,733 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:11:35,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:11:35,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:35,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash 96494708, now seen corresponding path program 2 times [2025-02-08 01:11:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:35,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468666862] [2025-02-08 01:11:35,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:35,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:11:35,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:35,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:35,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:35,814 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:11:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468666862] [2025-02-08 01:11:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468666862] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845304594] [2025-02-08 01:11:35,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:11:35,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:35,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:35,817 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:11:35,820 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:11:35,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:11:35,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:11:35,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:11:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:35,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 01:11:35,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:11:36,013 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:11:36,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:11:36,083 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:11:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845304594] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:11:36,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:11:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 01:11:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838412903] [2025-02-08 01:11:36,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:11:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:11:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:11:36,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:11:36,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:11:36,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-02-08 01:11:36,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:11:36,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:11:36,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-02-08 01:11:36,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:11:36,363 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-02-08 01:11:36,363 INFO L125 PetriNetUnfolderBase]: For 6774/6774 co-relation queries the response was YES. [2025-02-08 01:11:36,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9421 conditions, 1987 events. 1447/1987 cut-off events. For 6774/6774 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8153 event pairs, 375 based on Foata normal form. 68/2047 useless extension candidates. Maximal degree in co-relation 8390. Up to 1150 conditions per place. [2025-02-08 01:11:36,378 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-02-08 01:11:36,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 1043 flow [2025-02-08 01:11:36,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:11:36,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:11:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-02-08 01:11:36,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-02-08 01:11:36,380 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 354 flow. Second operand 5 states and 111 transitions. [2025-02-08 01:11:36,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 1043 flow [2025-02-08 01:11:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:11:36,391 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2025-02-08 01:11:36,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-02-08 01:11:36,392 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2025-02-08 01:11:36,393 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2025-02-08 01:11:36,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:11:36,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:11:36,393 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, 1] [2025-02-08 01:11:36,401 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:11:36,593 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,SelfDestructingSolverStorable8 [2025-02-08 01:11:36,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 01:11:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:11:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1072297406, now seen corresponding path program 1 times [2025-02-08 01:11:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:11:36,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927055180] [2025-02-08 01:11:36,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:11:36,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:11:36,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:11:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:11:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927055180] [2025-02-08 01:11:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927055180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:11:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240817816] [2025-02-08 01:11:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:11:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:11:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:11:37,073 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:11:37,075 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:11:37,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:11:37,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:11:37,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:11:37,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:11:37,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 01:11:37,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:00,133 INFO L312 TraceCheckSpWp]: Computing backward predicates...