./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-context1.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/test-context1.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 d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:21:07,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:21:07,654 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:21:07,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:21:07,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:21:07,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:21:07,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:21:07,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:21:07,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:21:07,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:21:07,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:21:07,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:21:07,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:21:07,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:21:07,691 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:21:07,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:21:07,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:21:07,691 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:21:07,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:21:07,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:21:07,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:21:07,693 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:21:07,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:21:07,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:21:07,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:21:07,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:21:07,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:21:07,694 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 -> d63a80d2bfe8ff8bb62e6b5083cee589f2cb0f37dc67867654ab7601d82af23e [2025-02-08 01:21:07,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:21:07,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:21:07,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:21:07,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:21:07,966 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:21:07,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-context1.wvr.c [2025-02-08 01:21:09,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a3e545f6/467ad85f3f46460fadf9662bc7439dd8/FLAGa2e4e6b90 [2025-02-08 01:21:09,576 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:21:09,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-context1.wvr.c [2025-02-08 01:21:09,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a3e545f6/467ad85f3f46460fadf9662bc7439dd8/FLAGa2e4e6b90 [2025-02-08 01:21:09,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a3e545f6/467ad85f3f46460fadf9662bc7439dd8 [2025-02-08 01:21:09,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:21:09,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:21:09,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:21:09,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:21:09,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:21:09,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:21:09" (1/1) ... [2025-02-08 01:21:09,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:09, skipping insertion in model container [2025-02-08 01:21:09,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:21:09" (1/1) ... [2025-02-08 01:21:09,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:21:09,987 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/test-context1.wvr.c[2459,2472] [2025-02-08 01:21:09,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:21:10,005 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:21:10,024 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/test-context1.wvr.c[2459,2472] [2025-02-08 01:21:10,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:21:10,040 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:21:10,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10 WrapperNode [2025-02-08 01:21:10,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:21:10,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:21:10,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:21:10,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:21:10,046 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:21:10" (1/1) ... [2025-02-08 01:21:10,058 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:21:10" (1/1) ... [2025-02-08 01:21:10,074 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 122 [2025-02-08 01:21:10,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:21:10,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:21:10,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:21:10,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:21:10,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,097 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 01:21:10,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,103 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:21:10,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:21:10,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:21:10,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:21:10,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (1/1) ... [2025-02-08 01:21:10,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:21:10,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:10,134 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:21:10,136 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:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:21:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:21:10,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:21:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:21:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:21:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:21:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:21:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:21:10,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:21:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:21:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:21:10,157 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:21:10,240 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:21:10,242 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:21:10,442 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:21:10,442 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:21:10,601 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:21:10,602 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:21:10,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:21:10 BoogieIcfgContainer [2025-02-08 01:21:10,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:21:10,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:21:10,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:21:10,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:21:10,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:21:09" (1/3) ... [2025-02-08 01:21:10,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381f132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:21:10, skipping insertion in model container [2025-02-08 01:21:10,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:21:10" (2/3) ... [2025-02-08 01:21:10,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381f132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:21:10, skipping insertion in model container [2025-02-08 01:21:10,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:21:10" (3/3) ... [2025-02-08 01:21:10,611 INFO L128 eAbstractionObserver]: Analyzing ICFG test-context1.wvr.c [2025-02-08 01:21:10,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:21:10,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-context1.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-08 01:21:10,625 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:21:10,668 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:21:10,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-02-08 01:21:10,726 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-02-08 01:21:10,731 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:21:10,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 5/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-02-08 01:21:10,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-02-08 01:21:10,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 62 flow [2025-02-08 01:21:10,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:21:10,759 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4384e105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:21:10,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:21:10,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:21:10,770 INFO L124 PetriNetUnfolderBase]: 5/24 cut-off events. [2025-02-08 01:21:10,771 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:21:10,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:10,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:10,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:10,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash -217712492, now seen corresponding path program 1 times [2025-02-08 01:21:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367970238] [2025-02-08 01:21:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:21:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:10,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:21:10,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:21:10,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:10,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:10,946 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:21:10,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:10,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367970238] [2025-02-08 01:21:10,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367970238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:10,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:10,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:21:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59763786] [2025-02-08 01:21:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:10,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:21:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:10,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:21:10,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:21:10,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:10,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:21:10,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:10,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:10,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:11,089 INFO L124 PetriNetUnfolderBase]: 122/217 cut-off events. [2025-02-08 01:21:11,089 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 01:21:11,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 217 events. 122/217 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 706 event pairs, 94 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 405. Up to 214 conditions per place. [2025-02-08 01:21:11,094 INFO L140 encePairwiseOnDemand]: 26/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-02-08 01:21:11,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 98 flow [2025-02-08 01:21:11,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:21:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 01:21:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2025-02-08 01:21:11,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-08 01:21:11,109 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 62 flow. Second operand 2 states and 32 transitions. [2025-02-08 01:21:11,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 98 flow [2025-02-08 01:21:11,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:21:11,115 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2025-02-08 01:21:11,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2025-02-08 01:21:11,124 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-02-08 01:21:11,124 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2025-02-08 01:21:11,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:21:11,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:11,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:21:11,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash -734864719, now seen corresponding path program 1 times [2025-02-08 01:21:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52911317] [2025-02-08 01:21:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:21:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:11,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:21:11,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:21:11,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:11,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:11,305 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:21:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52911317] [2025-02-08 01:21:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52911317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:21:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052465258] [2025-02-08 01:21:11,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:21:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:11,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:21:11,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:21:11,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:11,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:21:11,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:11,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:11,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:11,428 INFO L124 PetriNetUnfolderBase]: 203/353 cut-off events. [2025-02-08 01:21:11,428 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 01:21:11,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 353 events. 203/353 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1261 event pairs, 82 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 709. Up to 176 conditions per place. [2025-02-08 01:21:11,432 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 28 selfloop transitions, 2 changer transitions 3/36 dead transitions. [2025-02-08 01:21:11,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 144 flow [2025-02-08 01:21:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:21:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:21:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-02-08 01:21:11,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 01:21:11,436 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 49 transitions. [2025-02-08 01:21:11,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 144 flow [2025-02-08 01:21:11,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:21:11,439 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 62 flow [2025-02-08 01:21:11,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-02-08 01:21:11,439 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-02-08 01:21:11,440 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 62 flow [2025-02-08 01:21:11,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:21:11,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:11,442 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:11,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:21:11,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1845090846, now seen corresponding path program 1 times [2025-02-08 01:21:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-02-08 01:21:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:21:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:11,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:21:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:21:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:11,548 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:21:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:11,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-02-08 01:21:11,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145259747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:11,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:11,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:21:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209914347] [2025-02-08 01:21:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:11,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:21:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:11,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:21:11,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:21:11,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:11,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:11,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:11,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:11,642 INFO L124 PetriNetUnfolderBase]: 251/446 cut-off events. [2025-02-08 01:21:11,642 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 01:21:11,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 446 events. 251/446 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1675 event pairs, 113 based on Foata normal form. 11/387 useless extension candidates. Maximal degree in co-relation 934. Up to 306 conditions per place. [2025-02-08 01:21:11,645 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2025-02-08 01:21:11,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 163 flow [2025-02-08 01:21:11,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:21:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:21:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-08 01:21:11,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-02-08 01:21:11,648 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 62 flow. Second operand 3 states and 50 transitions. [2025-02-08 01:21:11,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 163 flow [2025-02-08 01:21:11,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:21:11,650 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 72 flow [2025-02-08 01:21:11,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2025-02-08 01:21:11,651 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2025-02-08 01:21:11,652 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 72 flow [2025-02-08 01:21:11,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:11,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:11,652 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:11,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:21:11,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 418410670, now seen corresponding path program 1 times [2025-02-08 01:21:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-02-08 01:21:11,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:21:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:11,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:21:11,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:21:11,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:11,830 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:21:11,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:11,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-02-08 01:21:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859649173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:11,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:21:11,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582642805] [2025-02-08 01:21:11,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:21:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:11,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:21:11,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:21:11,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:11,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:21:11,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:11,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:11,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:11,966 INFO L124 PetriNetUnfolderBase]: 319/585 cut-off events. [2025-02-08 01:21:11,967 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 01:21:11,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 585 events. 319/585 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2459 event pairs, 285 based on Foata normal form. 12/503 useless extension candidates. Maximal degree in co-relation 1262. Up to 443 conditions per place. [2025-02-08 01:21:11,971 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 21 selfloop transitions, 2 changer transitions 15/41 dead transitions. [2025-02-08 01:21:11,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 184 flow [2025-02-08 01:21:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:21:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:21:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-08 01:21:11,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-02-08 01:21:11,975 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 72 flow. Second operand 4 states and 57 transitions. [2025-02-08 01:21:11,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 184 flow [2025-02-08 01:21:11,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:21:11,977 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 84 flow [2025-02-08 01:21:11,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-02-08 01:21:11,978 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-02-08 01:21:11,978 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 84 flow [2025-02-08 01:21:11,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:21:11,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:11,978 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:11,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:21:11,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:11,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1752251909, now seen corresponding path program 1 times [2025-02-08 01:21:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:11,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-02-08 01:21:11,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:21:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:11,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:21:12,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:21:12,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:12,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-02-08 01:21:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259035135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:12,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:21:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054448316] [2025-02-08 01:21:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:21:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:12,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:21:12,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:21:12,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:12,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:21:12,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:12,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:12,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:12,563 INFO L124 PetriNetUnfolderBase]: 331/583 cut-off events. [2025-02-08 01:21:12,563 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-08 01:21:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 583 events. 331/583 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2176 event pairs, 68 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 1281. Up to 157 conditions per place. [2025-02-08 01:21:12,566 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 44 selfloop transitions, 5 changer transitions 12/64 dead transitions. [2025-02-08 01:21:12,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 64 transitions, 295 flow [2025-02-08 01:21:12,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:21:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:21:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-02-08 01:21:12,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 01:21:12,569 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 84 flow. Second operand 6 states and 91 transitions. [2025-02-08 01:21:12,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 64 transitions, 295 flow [2025-02-08 01:21:12,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 289 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-08 01:21:12,572 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 98 flow [2025-02-08 01:21:12,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-02-08 01:21:12,573 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2025-02-08 01:21:12,573 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 98 flow [2025-02-08 01:21:12,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:21:12,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:12,573 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:21:12,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash -526005896, now seen corresponding path program 2 times [2025-02-08 01:21:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415943752] [2025-02-08 01:21:12,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:21:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:12,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-02-08 01:21:12,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:21:12,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:21:12,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415943752] [2025-02-08 01:21:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415943752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:21:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:21:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:21:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125141333] [2025-02-08 01:21:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:21:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:21:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:12,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:21:12,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:21:12,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:12,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:21:12,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:12,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:12,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:12,842 INFO L124 PetriNetUnfolderBase]: 719/1265 cut-off events. [2025-02-08 01:21:12,843 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2025-02-08 01:21:12,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1265 events. 719/1265 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5621 event pairs, 280 based on Foata normal form. 22/1090 useless extension candidates. Maximal degree in co-relation 2837. Up to 462 conditions per place. [2025-02-08 01:21:12,849 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 50 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-02-08 01:21:12,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 312 flow [2025-02-08 01:21:12,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:21:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:21:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-08 01:21:12,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-02-08 01:21:12,851 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 98 flow. Second operand 4 states and 72 transitions. [2025-02-08 01:21:12,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 312 flow [2025-02-08 01:21:12,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:21:12,853 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 152 flow [2025-02-08 01:21:12,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-02-08 01:21:12,854 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2025-02-08 01:21:12,854 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 152 flow [2025-02-08 01:21:12,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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:21:12,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:12,855 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:12,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:21:12,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:12,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1477515784, now seen corresponding path program 3 times [2025-02-08 01:21:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184082700] [2025-02-08 01:21:12,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:21:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:12,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:21:12,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:21:12,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:21:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:21:13,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184082700] [2025-02-08 01:21:13,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184082700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70742341] [2025-02-08 01:21:13,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:21:13,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:13,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:13,079 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:21:13,082 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:21:13,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-02-08 01:21:13,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 01:21:13,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:21:13,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:13,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:21:13,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:21:13,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:21:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70742341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:13,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-08 01:21:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900599541] [2025-02-08 01:21:13,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:13,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 01:21:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:13,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 01:21:13,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:21:13,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:13,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 152 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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:21:13,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:13,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:13,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:14,055 INFO L124 PetriNetUnfolderBase]: 1255/2228 cut-off events. [2025-02-08 01:21:14,056 INFO L125 PetriNetUnfolderBase]: For 1347/1347 co-relation queries the response was YES. [2025-02-08 01:21:14,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 2228 events. 1255/2228 cut-off events. For 1347/1347 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11613 event pairs, 404 based on Foata normal form. 33/1909 useless extension candidates. Maximal degree in co-relation 5321. Up to 1122 conditions per place. [2025-02-08 01:21:14,067 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 4 changer transitions 65/105 dead transitions. [2025-02-08 01:21:14,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 574 flow [2025-02-08 01:21:14,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:21:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:21:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2025-02-08 01:21:14,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-02-08 01:21:14,069 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 152 flow. Second operand 9 states and 138 transitions. [2025-02-08 01:21:14,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 574 flow [2025-02-08 01:21:14,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 564 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-02-08 01:21:14,075 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 180 flow [2025-02-08 01:21:14,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-02-08 01:21:14,075 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-02-08 01:21:14,075 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 180 flow [2025-02-08 01:21:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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:21:14,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:14,076 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:14,085 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:21:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:14,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:14,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 580815253, now seen corresponding path program 4 times [2025-02-08 01:21:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834907270] [2025-02-08 01:21:14,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:21:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:14,292 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 01:21:14,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:21:14,310 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:21:14,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:21:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834907270] [2025-02-08 01:21:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834907270] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540509942] [2025-02-08 01:21:14,586 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:21:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:14,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:14,589 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:21:14,591 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:21:14,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-02-08 01:21:14,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:21:14,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:21:14,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:14,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 01:21:14,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:21:14,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:15,071 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:21:15,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-08 01:21:15,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:21:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540509942] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:15,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:15,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 16 [2025-02-08 01:21:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309521336] [2025-02-08 01:21:15,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:15,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:21:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:15,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:21:15,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:21:15,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:15,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 180 flow. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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:21:15,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:15,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:15,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:16,276 INFO L124 PetriNetUnfolderBase]: 1998/3447 cut-off events. [2025-02-08 01:21:16,276 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2025-02-08 01:21:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8738 conditions, 3447 events. 1998/3447 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 18236 event pairs, 104 based on Foata normal form. 24/2935 useless extension candidates. Maximal degree in co-relation 8723. Up to 625 conditions per place. [2025-02-08 01:21:16,295 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 139 selfloop transitions, 37 changer transitions 90/269 dead transitions. [2025-02-08 01:21:16,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 269 transitions, 1452 flow [2025-02-08 01:21:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 01:21:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 01:21:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 381 transitions. [2025-02-08 01:21:16,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185064935064936 [2025-02-08 01:21:16,298 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 180 flow. Second operand 22 states and 381 transitions. [2025-02-08 01:21:16,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 269 transitions, 1452 flow [2025-02-08 01:21:16,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 269 transitions, 1422 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-08 01:21:16,314 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 604 flow [2025-02-08 01:21:16,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=604, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-02-08 01:21:16,315 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 45 predicate places. [2025-02-08 01:21:16,317 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 604 flow [2025-02-08 01:21:16,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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:21:16,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:16,317 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:16,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:21:16,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:16,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:16,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:16,519 INFO L85 PathProgramCache]: Analyzing trace with hash 669385594, now seen corresponding path program 5 times [2025-02-08 01:21:16,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:16,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087458883] [2025-02-08 01:21:16,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:21:16,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:16,529 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-02-08 01:21:16,544 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 01:21:16,544 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 01:21:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:21:16,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087458883] [2025-02-08 01:21:16,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087458883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:16,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391144629] [2025-02-08 01:21:16,737 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:21:16,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:16,740 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:21:16,742 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:21:16,787 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-02-08 01:21:16,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 01:21:16,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-08 01:21:16,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:16,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:21:16,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:21:16,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 01:21:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391144629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:17,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:17,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-02-08 01:21:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000207192] [2025-02-08 01:21:17,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:17,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:21:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:17,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:21:17,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:21:17,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:17,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 604 flow. Second operand has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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:21:17,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:17,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:17,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:17,992 INFO L124 PetriNetUnfolderBase]: 2573/4505 cut-off events. [2025-02-08 01:21:17,993 INFO L125 PetriNetUnfolderBase]: For 7404/7404 co-relation queries the response was YES. [2025-02-08 01:21:18,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 4505 events. 2573/4505 cut-off events. For 7404/7404 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 26431 event pairs, 1832 based on Foata normal form. 52/3848 useless extension candidates. Maximal degree in co-relation 11866. Up to 3442 conditions per place. [2025-02-08 01:21:18,012 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 59 selfloop transitions, 4 changer transitions 81/147 dead transitions. [2025-02-08 01:21:18,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 147 transitions, 1149 flow [2025-02-08 01:21:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:21:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:21:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-02-08 01:21:18,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-02-08 01:21:18,015 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 604 flow. Second operand 11 states and 161 transitions. [2025-02-08 01:21:18,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 147 transitions, 1149 flow [2025-02-08 01:21:18,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 895 flow, removed 114 selfloop flow, removed 6 redundant places. [2025-02-08 01:21:18,038 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 416 flow [2025-02-08 01:21:18,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2025-02-08 01:21:18,039 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2025-02-08 01:21:18,039 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 416 flow [2025-02-08 01:21:18,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.25) internal successors, (165), 20 states have internal predecessors, (165), 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:21:18,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:18,039 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:18,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 01:21:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:18,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash -708795319, now seen corresponding path program 6 times [2025-02-08 01:21:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890463678] [2025-02-08 01:21:18,241 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:21:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:18,254 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-02-08 01:21:18,299 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:21:18,299 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 01:21:18,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:21:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890463678] [2025-02-08 01:21:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890463678] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188849635] [2025-02-08 01:21:18,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:21:18,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:18,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:18,732 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:21:18,734 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:21:18,795 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 3 equivalence classes. [2025-02-08 01:21:18,826 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 01:21:18,827 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-08 01:21:18,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:18,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:21:18,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:21:18,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:19,016 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:21:19,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-08 01:21:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:21:19,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188849635] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:19,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:19,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2025-02-08 01:21:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582286815] [2025-02-08 01:21:19,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 01:21:19,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:19,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 01:21:19,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:21:19,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:19,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 416 flow. Second operand has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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:21:19,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:19,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:19,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:20,611 INFO L124 PetriNetUnfolderBase]: 3206/5541 cut-off events. [2025-02-08 01:21:20,612 INFO L125 PetriNetUnfolderBase]: For 3486/3486 co-relation queries the response was YES. [2025-02-08 01:21:20,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 5541 events. 3206/5541 cut-off events. For 3486/3486 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 32067 event pairs, 510 based on Foata normal form. 3/4686 useless extension candidates. Maximal degree in co-relation 13164. Up to 1000 conditions per place. [2025-02-08 01:21:20,650 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 144 selfloop transitions, 60 changer transitions 90/297 dead transitions. [2025-02-08 01:21:20,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 297 transitions, 1649 flow [2025-02-08 01:21:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 01:21:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 01:21:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 375 transitions. [2025-02-08 01:21:20,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5822981366459627 [2025-02-08 01:21:20,653 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 416 flow. Second operand 23 states and 375 transitions. [2025-02-08 01:21:20,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 297 transitions, 1649 flow [2025-02-08 01:21:20,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 297 transitions, 1593 flow, removed 25 selfloop flow, removed 9 redundant places. [2025-02-08 01:21:20,677 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 688 flow [2025-02-08 01:21:20,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=688, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-02-08 01:21:20,678 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 69 predicate places. [2025-02-08 01:21:20,679 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 688 flow [2025-02-08 01:21:20,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.529411764705882) internal successors, (145), 17 states have internal predecessors, (145), 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:21:20,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:20,680 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:20,688 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:21:20,880 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,SelfDestructingSolverStorable9 [2025-02-08 01:21:20,881 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -602796691, now seen corresponding path program 7 times [2025-02-08 01:21:20,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363231488] [2025-02-08 01:21:20,882 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:21:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:20,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 01:21:20,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 01:21:20,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:20,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 01:21:21,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363231488] [2025-02-08 01:21:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363231488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648661428] [2025-02-08 01:21:21,023 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:21:21,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:21,025 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:21:21,027 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:21:21,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 01:21:21,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 01:21:21,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:21:21,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:21,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:21:21,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 01:21:21,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 01:21:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648661428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:21,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-02-08 01:21:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925297065] [2025-02-08 01:21:21,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:21,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:21:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:21,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:21:21,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:21:21,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:21,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:21,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:21,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:21,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:22,026 INFO L124 PetriNetUnfolderBase]: 5593/9636 cut-off events. [2025-02-08 01:21:22,026 INFO L125 PetriNetUnfolderBase]: For 8502/8502 co-relation queries the response was YES. [2025-02-08 01:21:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23745 conditions, 9636 events. 5593/9636 cut-off events. For 8502/8502 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 60242 event pairs, 1470 based on Foata normal form. 33/8175 useless extension candidates. Maximal degree in co-relation 23716. Up to 2498 conditions per place. [2025-02-08 01:21:22,068 INFO L140 encePairwiseOnDemand]: 25/28 looper letters, 104 selfloop transitions, 81 changer transitions 0/188 dead transitions. [2025-02-08 01:21:22,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1677 flow [2025-02-08 01:21:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:21:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:21:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-02-08 01:21:22,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-02-08 01:21:22,069 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 688 flow. Second operand 6 states and 114 transitions. [2025-02-08 01:21:22,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1677 flow [2025-02-08 01:21:22,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 188 transitions, 1610 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-02-08 01:21:22,112 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 1356 flow [2025-02-08 01:21:22,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1356, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2025-02-08 01:21:22,113 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 74 predicate places. [2025-02-08 01:21:22,113 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 1356 flow [2025-02-08 01:21:22,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:21:22,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:22,114 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:22,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 01:21:22,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 01:21:22,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:22,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -622175800, now seen corresponding path program 8 times [2025-02-08 01:21:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:22,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-02-08 01:21:22,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:21:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:22,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 01:21:22,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 01:21:22,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:21:22,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:21:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156395231] [2025-02-08 01:21:22,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156395231] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612042417] [2025-02-08 01:21:22,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:21:22,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:22,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:22,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:21:22,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:21:22,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 01:21:22,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 01:21:22,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:21:22,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:22,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 01:21:22,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:21:22,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 01:21:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612042417] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:23,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-02-08 01:21:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031110834] [2025-02-08 01:21:23,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:23,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 01:21:23,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:23,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 01:21:23,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2025-02-08 01:21:23,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:23,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 1356 flow. Second operand has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 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:21:23,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:23,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:23,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:25,084 INFO L124 PetriNetUnfolderBase]: 11029/19216 cut-off events. [2025-02-08 01:21:25,085 INFO L125 PetriNetUnfolderBase]: For 29938/29938 co-relation queries the response was YES. [2025-02-08 01:21:25,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49586 conditions, 19216 events. 11029/19216 cut-off events. For 29938/29938 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 141365 event pairs, 3417 based on Foata normal form. 451/16621 useless extension candidates. Maximal degree in co-relation 49553. Up to 7523 conditions per place. [2025-02-08 01:21:25,182 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 108 selfloop transitions, 6 changer transitions 187/304 dead transitions. [2025-02-08 01:21:25,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 304 transitions, 3086 flow [2025-02-08 01:21:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:21:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:21:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 186 transitions. [2025-02-08 01:21:25,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.510989010989011 [2025-02-08 01:21:25,184 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 1356 flow. Second operand 13 states and 186 transitions. [2025-02-08 01:21:25,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 304 transitions, 3086 flow [2025-02-08 01:21:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 304 transitions, 3064 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-02-08 01:21:25,368 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 1273 flow [2025-02-08 01:21:25,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1273, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-02-08 01:21:25,370 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2025-02-08 01:21:25,370 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 1273 flow [2025-02-08 01:21:25,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.25925925925926) internal successors, (223), 27 states have internal predecessors, (223), 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:21:25,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:25,372 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:25,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 01:21:25,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 01:21:25,572 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:25,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:25,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1132565483, now seen corresponding path program 9 times [2025-02-08 01:21:25,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:25,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720136698] [2025-02-08 01:21:25,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:21:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:25,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-02-08 01:21:25,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:21:25,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 01:21:25,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:21:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720136698] [2025-02-08 01:21:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720136698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289744323] [2025-02-08 01:21:26,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:21:26,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:26,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:21:26,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:21:26,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-02-08 01:21:26,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 01:21:26,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 01:21:26,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:26,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 01:21:26,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:26,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 01:21:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:21:26,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2025-02-08 01:21:27,484 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:21:27,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2025-02-08 01:21:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 01:21:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289744323] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:27,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-02-08 01:21:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849468764] [2025-02-08 01:21:27,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 01:21:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:27,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 01:21:27,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-02-08 01:21:27,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:27,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 1273 flow. Second operand has 31 states, 31 states have (on average 7.741935483870968) internal successors, (240), 31 states have internal predecessors, (240), 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:21:27,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:27,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:27,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:33,816 INFO L124 PetriNetUnfolderBase]: 29067/49753 cut-off events. [2025-02-08 01:21:33,816 INFO L125 PetriNetUnfolderBase]: For 121731/121731 co-relation queries the response was YES. [2025-02-08 01:21:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140880 conditions, 49753 events. 29067/49753 cut-off events. For 121731/121731 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 392734 event pairs, 6995 based on Foata normal form. 36/42060 useless extension candidates. Maximal degree in co-relation 140842. Up to 9175 conditions per place. [2025-02-08 01:21:34,115 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 557 selfloop transitions, 297 changer transitions 120/977 dead transitions. [2025-02-08 01:21:34,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 977 transitions, 11113 flow [2025-02-08 01:21:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-08 01:21:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-02-08 01:21:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 615 transitions. [2025-02-08 01:21:34,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5936293436293436 [2025-02-08 01:21:34,118 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 1273 flow. Second operand 37 states and 615 transitions. [2025-02-08 01:21:34,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 977 transitions, 11113 flow [2025-02-08 01:21:35,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 977 transitions, 8581 flow, removed 788 selfloop flow, removed 19 redundant places. [2025-02-08 01:21:35,015 INFO L231 Difference]: Finished difference. Result has 139 places, 434 transitions, 5580 flow [2025-02-08 01:21:35,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5580, PETRI_PLACES=139, PETRI_TRANSITIONS=434} [2025-02-08 01:21:35,016 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 112 predicate places. [2025-02-08 01:21:35,017 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 434 transitions, 5580 flow [2025-02-08 01:21:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.741935483870968) internal successors, (240), 31 states have internal predecessors, (240), 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:21:35,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:35,017 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:35,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 01:21:35,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:35,218 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:35,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2106891364, now seen corresponding path program 10 times [2025-02-08 01:21:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568349518] [2025-02-08 01:21:35,219 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:21:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:35,241 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-08 01:21:35,253 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:21:35,253 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:21:35,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:35,908 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 01:21:35,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568349518] [2025-02-08 01:21:35,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568349518] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:35,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564336615] [2025-02-08 01:21:35,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:21:35,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:35,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:35,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:21:35,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 01:21:36,023 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-08 01:21:36,080 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 01:21:36,080 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:21:36,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:36,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 01:21:36,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:21:36,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:36,958 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:21:36,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-08 01:21:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 01:21:37,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564336615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:37,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:37,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 10] total 30 [2025-02-08 01:21:37,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064138699] [2025-02-08 01:21:37,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:37,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 01:21:37,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:37,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 01:21:37,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2025-02-08 01:21:37,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:37,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 434 transitions, 5580 flow. Second operand has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 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:21:37,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:37,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:37,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:21:52,145 INFO L124 PetriNetUnfolderBase]: 70999/121141 cut-off events. [2025-02-08 01:21:52,145 INFO L125 PetriNetUnfolderBase]: For 381889/381889 co-relation queries the response was YES. [2025-02-08 01:21:52,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354449 conditions, 121141 events. 70999/121141 cut-off events. For 381889/381889 co-relation queries the response was YES. Maximal size of possible extension queue 2145. Compared 1062370 event pairs, 4076 based on Foata normal form. 140/102521 useless extension candidates. Maximal degree in co-relation 354400. Up to 22300 conditions per place. [2025-02-08 01:21:53,127 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 498 selfloop transitions, 973 changer transitions 171/1645 dead transitions. [2025-02-08 01:21:53,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1645 transitions, 19663 flow [2025-02-08 01:21:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-02-08 01:21:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-02-08 01:21:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 1051 transitions. [2025-02-08 01:21:53,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6361985472154964 [2025-02-08 01:21:53,131 INFO L175 Difference]: Start difference. First operand has 139 places, 434 transitions, 5580 flow. Second operand 59 states and 1051 transitions. [2025-02-08 01:21:53,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 1645 transitions, 19663 flow [2025-02-08 01:21:56,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1645 transitions, 18411 flow, removed 622 selfloop flow, removed 4 redundant places. [2025-02-08 01:21:56,942 INFO L231 Difference]: Finished difference. Result has 222 places, 1039 transitions, 16851 flow [2025-02-08 01:21:56,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=5230, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=402, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=16851, PETRI_PLACES=222, PETRI_TRANSITIONS=1039} [2025-02-08 01:21:56,943 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 195 predicate places. [2025-02-08 01:21:56,943 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 1039 transitions, 16851 flow [2025-02-08 01:21:56,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 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:21:56,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:21:56,944 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:21:56,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 01:21:57,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:57,145 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:21:57,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:21:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash 379670, now seen corresponding path program 11 times [2025-02-08 01:21:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:21:57,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578157190] [2025-02-08 01:21:57,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:21:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:21:57,156 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-02-08 01:21:57,193 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 01:21:57,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 01:21:57,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:21:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:21:57,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578157190] [2025-02-08 01:21:57,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578157190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:21:57,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920327326] [2025-02-08 01:21:57,773 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:21:57,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:21:57,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:21:57,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:21:57,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 01:21:57,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 5 equivalence classes. [2025-02-08 01:21:57,875 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 01:21:57,875 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 01:21:57,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:21:57,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 01:21:57,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:21:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:21:58,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:21:58,255 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 01:21:58,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 11 [2025-02-08 01:21:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 01:21:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920327326] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:21:58,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:21:58,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 29 [2025-02-08 01:21:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900945742] [2025-02-08 01:21:58,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:21:58,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 01:21:58,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:21:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 01:21:58,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-02-08 01:21:58,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-02-08 01:21:58,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 1039 transitions, 16851 flow. Second operand has 30 states, 30 states have (on average 8.566666666666666) internal successors, (257), 30 states have internal predecessors, (257), 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:21:58,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:21:58,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-02-08 01:21:58,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand