./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:09:44,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:09:44,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:09:44,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:09:44,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:09:44,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:09:44,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:09:44,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:09:44,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:09:44,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:09:44,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:09:44,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:09:44,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:09:44,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:09:44,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:09:44,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:09:44,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:09:44,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:09:44,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:09:44,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:09:44,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:09:44,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:09:44,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:09:44,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:09:44,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:09:44,975 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/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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2025-03-14 01:09:45,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:09:45,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:09:45,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:09:45,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:09:45,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:09:45,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-03-14 01:09:46,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eecd945/e1fc633fb2d34d1783e15f3776bf8d7f/FLAG19cff3321 [2025-03-14 01:09:46,656 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:09:46,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-03-14 01:09:46,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eecd945/e1fc633fb2d34d1783e15f3776bf8d7f/FLAG19cff3321 [2025-03-14 01:09:46,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eecd945/e1fc633fb2d34d1783e15f3776bf8d7f [2025-03-14 01:09:46,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:09:46,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:09:46,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:09:46,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:09:46,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:09:46,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:46,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e597254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46, skipping insertion in model container [2025-03-14 01:09:46,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:46,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:09:46,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3451,3464] [2025-03-14 01:09:46,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:09:46,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:09:46,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c[3451,3464] [2025-03-14 01:09:46,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:09:46,948 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:09:46,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46 WrapperNode [2025-03-14 01:09:46,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:09:46,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:09:46,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:09:46,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:09:46,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:46,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:46,986 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 224 [2025-03-14 01:09:46,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:09:46,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:09:46,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:09:46,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:09:46,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:46,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:46,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,009 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-14 01:09:47,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:09:47,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:09:47,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:09:47,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:09:47,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (1/1) ... [2025-03-14 01:09:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:09:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:47,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:09:47,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:09:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:09:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:09:47,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:09:47,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:09:47,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:09:47,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:09:47,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:09:47,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:09:47,071 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:09:47,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:09:47,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:09:47,454 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:09:47,455 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:09:47,455 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:09:47,725 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:09:47,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:09:47 BoogieIcfgContainer [2025-03-14 01:09:47,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:09:47,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:09:47,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:09:47,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:09:47,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:09:46" (1/3) ... [2025-03-14 01:09:47,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443b659c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:09:47, skipping insertion in model container [2025-03-14 01:09:47,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:09:46" (2/3) ... [2025-03-14 01:09:47,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443b659c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:09:47, skipping insertion in model container [2025-03-14 01:09:47,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:09:47" (3/3) ... [2025-03-14 01:09:47,733 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-03-14 01:09:47,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:09:47,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-14 01:09:47,745 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:09:47,793 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:09:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 105 flow [2025-03-14 01:09:47,851 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2025-03-14 01:09:47,853 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:09:47,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 7/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-14 01:09:47,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 105 flow [2025-03-14 01:09:47,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 38 transitions, 94 flow [2025-03-14 01:09:47,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:09:47,877 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;@20f241da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:09:47,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:09:47,886 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:09:47,886 INFO L124 PetriNetUnfolderBase]: 7/37 cut-off events. [2025-03-14 01:09:47,886 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:09:47,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:47,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:47,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:47,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:47,895 INFO L85 PathProgramCache]: Analyzing trace with hash 698142720, now seen corresponding path program 1 times [2025-03-14 01:09:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:47,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079090840] [2025-03-14 01:09:47,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:09:48,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:09:48,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:48,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:09:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:48,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079090840] [2025-03-14 01:09:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079090840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:48,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:48,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:09:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425546235] [2025-03-14 01:09:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:48,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:09:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:48,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:09:48,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:09:48,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:48,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:48,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:48,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:48,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:48,344 INFO L124 PetriNetUnfolderBase]: 727/1227 cut-off events. [2025-03-14 01:09:48,344 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-14 01:09:48,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2321 conditions, 1227 events. 727/1227 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5793 event pairs, 595 based on Foata normal form. 0/1116 useless extension candidates. Maximal degree in co-relation 2156. Up to 991 conditions per place. [2025-03-14 01:09:48,359 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 28 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-03-14 01:09:48,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 146 flow [2025-03-14 01:09:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:09:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:09:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2025-03-14 01:09:48,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-14 01:09:48,369 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 94 flow. Second operand 2 states and 52 transitions. [2025-03-14 01:09:48,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 146 flow [2025-03-14 01:09:48,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:09:48,377 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 78 flow [2025-03-14 01:09:48,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2025-03-14 01:09:48,383 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-03-14 01:09:48,384 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 78 flow [2025-03-14 01:09:48,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:48,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:48,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:09:48,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:48,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash 922540124, now seen corresponding path program 1 times [2025-03-14 01:09:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220881759] [2025-03-14 01:09:48,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:09:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:09:48,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:48,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:09:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:48,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220881759] [2025-03-14 01:09:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220881759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:09:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865103540] [2025-03-14 01:09:48,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:09:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:48,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:09:48,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:09:48,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:48,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-03-14 01:09:48,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:48,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:48,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:48,920 INFO L124 PetriNetUnfolderBase]: 827/1422 cut-off events. [2025-03-14 01:09:48,920 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-14 01:09:48,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 1422 events. 827/1422 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6935 event pairs, 682 based on Foata normal form. 73/1371 useless extension candidates. Maximal degree in co-relation 2616. Up to 991 conditions per place. [2025-03-14 01:09:48,927 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 27 selfloop transitions, 2 changer transitions 15/52 dead transitions. [2025-03-14 01:09:48,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 201 flow [2025-03-14 01:09:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:09:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:09:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-03-14 01:09:48,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-14 01:09:48,928 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 78 flow. Second operand 4 states and 91 transitions. [2025-03-14 01:09:48,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 201 flow [2025-03-14 01:09:48,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:09:48,930 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 96 flow [2025-03-14 01:09:48,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-14 01:09:48,931 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-03-14 01:09:48,931 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 96 flow [2025-03-14 01:09:48,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-03-14 01:09:48,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:48,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:48,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:09:48,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:48,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1877482574, now seen corresponding path program 1 times [2025-03-14 01:09:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-03-14 01:09:48,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:48,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:09:48,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:09:48,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:48,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:49,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:49,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558157259] [2025-03-14 01:09:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558157259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:49,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:09:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997459402] [2025-03-14 01:09:49,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:09:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:49,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:09:49,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:09:49,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:49,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03-14 01:09:49,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:49,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:49,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:49,295 INFO L124 PetriNetUnfolderBase]: 927/1558 cut-off events. [2025-03-14 01:09:49,295 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-03-14 01:09:49,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3196 conditions, 1558 events. 927/1558 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7558 event pairs, 775 based on Foata normal form. 77/1523 useless extension candidates. Maximal degree in co-relation 3190. Up to 992 conditions per place. [2025-03-14 01:09:49,301 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 28 selfloop transitions, 2 changer transitions 17/55 dead transitions. [2025-03-14 01:09:49,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 236 flow [2025-03-14 01:09:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:09:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:09:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-14 01:09:49,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-03-14 01:09:49,303 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 96 flow. Second operand 4 states and 92 transitions. [2025-03-14 01:09:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 236 flow [2025-03-14 01:09:49,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 232 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:09:49,304 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 108 flow [2025-03-14 01:09:49,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-03-14 01:09:49,305 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-14 01:09:49,305 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 108 flow [2025-03-14 01:09:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03-14 01:09:49,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:49,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:49,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:09:49,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:49,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash -592873294, now seen corresponding path program 1 times [2025-03-14 01:09:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844701262] [2025-03-14 01:09:49,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:49,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:09:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:09:49,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:49,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:49,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844701262] [2025-03-14 01:09:49,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844701262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:49,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:49,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:09:49,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924315780] [2025-03-14 01:09:49,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:49,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:09:49,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:49,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:09:49,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:09:49,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:09:49,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 108 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-03-14 01:09:49,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:49,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:09:49,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:50,043 INFO L124 PetriNetUnfolderBase]: 1850/2857 cut-off events. [2025-03-14 01:09:50,044 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2025-03-14 01:09:50,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 2857 events. 1850/2857 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15010 event pairs, 529 based on Foata normal form. 1/2825 useless extension candidates. Maximal degree in co-relation 6487. Up to 981 conditions per place. [2025-03-14 01:09:50,062 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 87 selfloop transitions, 10 changer transitions 3/106 dead transitions. [2025-03-14 01:09:50,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 106 transitions, 497 flow [2025-03-14 01:09:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 01:09:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 01:09:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-03-14 01:09:50,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-03-14 01:09:50,065 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 108 flow. Second operand 8 states and 171 transitions. [2025-03-14 01:09:50,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 106 transitions, 497 flow [2025-03-14 01:09:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 106 transitions, 493 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:09:50,069 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 168 flow [2025-03-14 01:09:50,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2025-03-14 01:09:50,070 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2025-03-14 01:09:50,070 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 168 flow [2025-03-14 01:09:50,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-03-14 01:09:50,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:50,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:50,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:09:50,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:50,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2022539934, now seen corresponding path program 2 times [2025-03-14 01:09:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:50,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77416024] [2025-03-14 01:09:50,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:50,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:50,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:09:50,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:09:50,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77416024] [2025-03-14 01:09:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77416024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:50,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:50,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:09:50,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943180500] [2025-03-14 01:09:50,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:50,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:09:50,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:50,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:09:50,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:09:50,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:50,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:50,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:50,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:50,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:50,333 INFO L124 PetriNetUnfolderBase]: 1428/2346 cut-off events. [2025-03-14 01:09:50,334 INFO L125 PetriNetUnfolderBase]: For 1410/1544 co-relation queries the response was YES. [2025-03-14 01:09:50,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5733 conditions, 2346 events. 1428/2346 cut-off events. For 1410/1544 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12545 event pairs, 379 based on Foata normal form. 56/2245 useless extension candidates. Maximal degree in co-relation 5721. Up to 1747 conditions per place. [2025-03-14 01:09:50,350 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 44 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-03-14 01:09:50,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 305 flow [2025-03-14 01:09:50,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:09:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:09:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-14 01:09:50,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-03-14 01:09:50,351 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 168 flow. Second operand 3 states and 74 transitions. [2025-03-14 01:09:50,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 305 flow [2025-03-14 01:09:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 59 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:09:50,354 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 189 flow [2025-03-14 01:09:50,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-14 01:09:50,354 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-03-14 01:09:50,354 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 189 flow [2025-03-14 01:09:50,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:50,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:50,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:50,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:09:50,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:50,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash 739533958, now seen corresponding path program 3 times [2025-03-14 01:09:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776502876] [2025-03-14 01:09:50,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:09:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:50,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-03-14 01:09:50,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 31 statements. [2025-03-14 01:09:50,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:09:50,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:50,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:50,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776502876] [2025-03-14 01:09:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776502876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:50,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:09:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016421225] [2025-03-14 01:09:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:50,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:09:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:50,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:09:50,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:09:50,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:50,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:50,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:50,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:50,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:50,587 INFO L124 PetriNetUnfolderBase]: 1053/1883 cut-off events. [2025-03-14 01:09:50,587 INFO L125 PetriNetUnfolderBase]: For 1504/1504 co-relation queries the response was YES. [2025-03-14 01:09:50,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 1883 events. 1053/1883 cut-off events. For 1504/1504 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10283 event pairs, 400 based on Foata normal form. 66/1856 useless extension candidates. Maximal degree in co-relation 4928. Up to 991 conditions per place. [2025-03-14 01:09:50,596 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 46 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-03-14 01:09:50,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 331 flow [2025-03-14 01:09:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:09:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:09:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-14 01:09:50,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-03-14 01:09:50,599 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 189 flow. Second operand 3 states and 74 transitions. [2025-03-14 01:09:50,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 331 flow [2025-03-14 01:09:50,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 307 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-14 01:09:50,605 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 182 flow [2025-03-14 01:09:50,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-14 01:09:50,606 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-03-14 01:09:50,607 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 182 flow [2025-03-14 01:09:50,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:50,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:50,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:50,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:09:50,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:50,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -902180732, now seen corresponding path program 1 times [2025-03-14 01:09:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987451562] [2025-03-14 01:09:50,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:50,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:50,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987451562] [2025-03-14 01:09:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987451562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983578436] [2025-03-14 01:09:50,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:50,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:50,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:50,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:09:50,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:09:50,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:50,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:50,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:50,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983578436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:51,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-14 01:09:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380235405] [2025-03-14 01:09:51,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:51,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:09:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:51,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:09:51,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:09:51,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:51,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 182 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 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-03-14 01:09:51,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:51,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:51,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:51,417 INFO L124 PetriNetUnfolderBase]: 1723/3162 cut-off events. [2025-03-14 01:09:51,417 INFO L125 PetriNetUnfolderBase]: For 2055/2055 co-relation queries the response was YES. [2025-03-14 01:09:51,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8180 conditions, 3162 events. 1723/3162 cut-off events. For 2055/2055 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 19669 event pairs, 1086 based on Foata normal form. 112/3121 useless extension candidates. Maximal degree in co-relation 8167. Up to 1536 conditions per place. [2025-03-14 01:09:51,436 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 65 selfloop transitions, 6 changer transitions 4/87 dead transitions. [2025-03-14 01:09:51,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 470 flow [2025-03-14 01:09:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:09:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:09:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2025-03-14 01:09:51,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48639455782312924 [2025-03-14 01:09:51,437 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 182 flow. Second operand 7 states and 143 transitions. [2025-03-14 01:09:51,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 470 flow [2025-03-14 01:09:51,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 463 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:09:51,444 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 231 flow [2025-03-14 01:09:51,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2025-03-14 01:09:51,446 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2025-03-14 01:09:51,446 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 231 flow [2025-03-14 01:09:51,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 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-03-14 01:09:51,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:51,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:51,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:09:51,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:51,649 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:51,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 303496368, now seen corresponding path program 1 times [2025-03-14 01:09:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875862172] [2025-03-14 01:09:51,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:51,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:51,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:51,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:51,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875862172] [2025-03-14 01:09:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875862172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958660449] [2025-03-14 01:09:51,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:51,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:51,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:51,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:09:51,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:09:51,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:09:51,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:09:51,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:51,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:51,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:09:51,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:51,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:09:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958660449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:51,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:09:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-14 01:09:51,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666956609] [2025-03-14 01:09:51,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:51,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:09:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:51,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:09:51,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:09:51,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:51,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:51,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:51,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:51,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:52,395 INFO L124 PetriNetUnfolderBase]: 2733/5159 cut-off events. [2025-03-14 01:09:52,396 INFO L125 PetriNetUnfolderBase]: For 4395/4595 co-relation queries the response was YES. [2025-03-14 01:09:52,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13035 conditions, 5159 events. 2733/5159 cut-off events. For 4395/4595 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 35627 event pairs, 794 based on Foata normal form. 132/5022 useless extension candidates. Maximal degree in co-relation 13018. Up to 1449 conditions per place. [2025-03-14 01:09:52,442 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 72 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-03-14 01:09:52,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 528 flow [2025-03-14 01:09:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:09:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:09:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-14 01:09:52,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-14 01:09:52,444 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 231 flow. Second operand 4 states and 108 transitions. [2025-03-14 01:09:52,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 528 flow [2025-03-14 01:09:52,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 505 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-14 01:09:52,456 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 275 flow [2025-03-14 01:09:52,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-14 01:09:52,458 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2025-03-14 01:09:52,458 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 275 flow [2025-03-14 01:09:52,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:52,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:52,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:52,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:09:52,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-14 01:09:52,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -353677200, now seen corresponding path program 2 times [2025-03-14 01:09:52,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:52,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306575336] [2025-03-14 01:09:52,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:52,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:52,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-14 01:09:52,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-03-14 01:09:52,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:09:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:09:52,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:52,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306575336] [2025-03-14 01:09:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306575336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:09:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866294060] [2025-03-14 01:09:52,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:52,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:09:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:09:52,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:09:52,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-03-14 01:09:52,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:52,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:52,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-03-14 01:09:52,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:53,453 INFO L124 PetriNetUnfolderBase]: 3950/6847 cut-off events. [2025-03-14 01:09:53,453 INFO L125 PetriNetUnfolderBase]: For 11479/11894 co-relation queries the response was YES. [2025-03-14 01:09:53,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19147 conditions, 6847 events. 3950/6847 cut-off events. For 11479/11894 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 45164 event pairs, 1096 based on Foata normal form. 68/6591 useless extension candidates. Maximal degree in co-relation 19129. Up to 4060 conditions per place. [2025-03-14 01:09:53,488 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 78 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2025-03-14 01:09:53,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 608 flow [2025-03-14 01:09:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:09:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:09:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-03-14 01:09:53,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2025-03-14 01:09:53,489 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 275 flow. Second operand 6 states and 124 transitions. [2025-03-14 01:09:53,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 608 flow [2025-03-14 01:09:53,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 97 transitions, 590 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:09:53,502 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 305 flow [2025-03-14 01:09:53,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2025-03-14 01:09:53,504 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2025-03-14 01:09:53,504 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 305 flow [2025-03-14 01:09:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:53,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:53,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:09:53,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1606807992, now seen corresponding path program 1 times [2025-03-14 01:09:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677761976] [2025-03-14 01:09:53,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:53,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:53,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:09:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:09:53,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:53,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:09:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677761976] [2025-03-14 01:09:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677761976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:09:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:09:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:09:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641413154] [2025-03-14 01:09:53,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:53,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:09:53,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:53,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:09:53,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:09:53,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:53,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:53,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:53,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:53,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:54,111 INFO L124 PetriNetUnfolderBase]: 3789/6882 cut-off events. [2025-03-14 01:09:54,111 INFO L125 PetriNetUnfolderBase]: For 10776/11352 co-relation queries the response was YES. [2025-03-14 01:09:54,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19675 conditions, 6882 events. 3789/6882 cut-off events. For 10776/11352 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47422 event pairs, 1135 based on Foata normal form. 381/7127 useless extension candidates. Maximal degree in co-relation 19655. Up to 1972 conditions per place. [2025-03-14 01:09:54,151 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 81 selfloop transitions, 8 changer transitions 8/108 dead transitions. [2025-03-14 01:09:54,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 695 flow [2025-03-14 01:09:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:09:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:09:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-14 01:09:54,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-14 01:09:54,152 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 305 flow. Second operand 4 states and 114 transitions. [2025-03-14 01:09:54,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 695 flow [2025-03-14 01:09:54,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 676 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-14 01:09:54,165 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 287 flow [2025-03-14 01:09:54,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2025-03-14 01:09:54,165 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2025-03-14 01:09:54,165 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 287 flow [2025-03-14 01:09:54,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:09:54,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:54,166 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:54,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:09:54,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1344402442, now seen corresponding path program 1 times [2025-03-14 01:09:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936108105] [2025-03-14 01:09:54,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:54,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:09:54,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:09:54,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:09:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936108105] [2025-03-14 01:09:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936108105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677661500] [2025-03-14 01:09:54,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:09:54,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:54,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:54,315 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:09:54,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:09:54,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:09:54,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:09:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:09:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:54,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:09:54,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:09:54,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:09:54,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677661500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:54,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:54,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 01:09:54,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604249208] [2025-03-14 01:09:54,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:54,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:09:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:54,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:09:54,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:09:54,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2025-03-14 01:09:54,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 287 flow. Second operand has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 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-03-14 01:09:54,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:54,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2025-03-14 01:09:54,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:55,219 INFO L124 PetriNetUnfolderBase]: 4258/8200 cut-off events. [2025-03-14 01:09:55,219 INFO L125 PetriNetUnfolderBase]: For 15064/15461 co-relation queries the response was YES. [2025-03-14 01:09:55,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25001 conditions, 8200 events. 4258/8200 cut-off events. For 15064/15461 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 60923 event pairs, 2864 based on Foata normal form. 206/8254 useless extension candidates. Maximal degree in co-relation 24979. Up to 4848 conditions per place. [2025-03-14 01:09:55,256 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 42 selfloop transitions, 3 changer transitions 44/100 dead transitions. [2025-03-14 01:09:55,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 703 flow [2025-03-14 01:09:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:09:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:09:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2025-03-14 01:09:55,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2025-03-14 01:09:55,257 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 287 flow. Second operand 6 states and 128 transitions. [2025-03-14 01:09:55,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 703 flow [2025-03-14 01:09:55,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 665 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-14 01:09:55,268 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 289 flow [2025-03-14 01:09:55,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2025-03-14 01:09:55,268 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2025-03-14 01:09:55,268 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 289 flow [2025-03-14 01:09:55,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.333333333333334) internal successors, (184), 12 states have internal predecessors, (184), 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-03-14 01:09:55,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:55,269 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:55,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:09:55,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:55,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:55,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1034904702, now seen corresponding path program 2 times [2025-03-14 01:09:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479859372] [2025-03-14 01:09:55,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:55,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:09:55,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:09:55,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:55,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:09:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479859372] [2025-03-14 01:09:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479859372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679293800] [2025-03-14 01:09:56,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:56,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:56,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:09:56,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:09:56,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:09:56,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:09:56,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:56,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:56,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-14 01:09:56,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:57,493 INFO L349 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2025-03-14 01:09:57,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 13 [2025-03-14 01:09:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:09:57,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:58,253 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-03-14 01:09:58,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-03-14 01:09:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:09:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679293800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:58,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 40 [2025-03-14 01:09:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509726669] [2025-03-14 01:09:58,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-14 01:09:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:58,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-14 01:09:58,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1439, Unknown=0, NotChecked=0, Total=1640 [2025-03-14 01:09:59,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:09:59,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 289 flow. Second operand has 41 states, 41 states have (on average 9.317073170731707) internal successors, (382), 41 states have internal predecessors, (382), 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-03-14 01:09:59,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:59,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:09:59,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:05,009 INFO L124 PetriNetUnfolderBase]: 19590/29918 cut-off events. [2025-03-14 01:10:05,009 INFO L125 PetriNetUnfolderBase]: For 46962/46962 co-relation queries the response was YES. [2025-03-14 01:10:05,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89430 conditions, 29918 events. 19590/29918 cut-off events. For 46962/46962 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 206716 event pairs, 1933 based on Foata normal form. 572/28628 useless extension candidates. Maximal degree in co-relation 89408. Up to 8849 conditions per place. [2025-03-14 01:10:05,196 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 421 selfloop transitions, 104 changer transitions 75/606 dead transitions. [2025-03-14 01:10:05,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 606 transitions, 3915 flow [2025-03-14 01:10:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-14 01:10:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-14 01:10:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 915 transitions. [2025-03-14 01:10:05,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41895604395604397 [2025-03-14 01:10:05,199 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 289 flow. Second operand 52 states and 915 transitions. [2025-03-14 01:10:05,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 606 transitions, 3915 flow [2025-03-14 01:10:05,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 606 transitions, 3842 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-03-14 01:10:05,269 INFO L231 Difference]: Finished difference. Result has 137 places, 167 transitions, 1422 flow [2025-03-14 01:10:05,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=1422, PETRI_PLACES=137, PETRI_TRANSITIONS=167} [2025-03-14 01:10:05,270 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places. [2025-03-14 01:10:05,270 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 167 transitions, 1422 flow [2025-03-14 01:10:05,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.317073170731707) internal successors, (382), 41 states have internal predecessors, (382), 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-03-14 01:10:05,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:05,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:05,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:10:05,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:05,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:05,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1924846228, now seen corresponding path program 3 times [2025-03-14 01:10:05,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:05,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199465872] [2025-03-14 01:10:05,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:05,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:10:05,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:10:05,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:10:05,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:10:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199465872] [2025-03-14 01:10:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199465872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603642751] [2025-03-14 01:10:06,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:10:06,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:06,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:06,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:06,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:10:06,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:10:06,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:10:06,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:10:06,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:06,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 01:10:06,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:06,910 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 16 treesize of output 8 [2025-03-14 01:10:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:06,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:07,063 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:10:07,063 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 24 treesize of output 11 [2025-03-14 01:10:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603642751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:07,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:07,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2025-03-14 01:10:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521371225] [2025-03-14 01:10:07,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:07,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-14 01:10:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:07,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-14 01:10:07,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-03-14 01:10:07,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:10:07,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 167 transitions, 1422 flow. Second operand has 32 states, 32 states have (on average 9.96875) internal successors, (319), 32 states have internal predecessors, (319), 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-03-14 01:10:07,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:07,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:10:07,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:16,158 INFO L124 PetriNetUnfolderBase]: 41442/63312 cut-off events. [2025-03-14 01:10:16,158 INFO L125 PetriNetUnfolderBase]: For 459283/459471 co-relation queries the response was YES. [2025-03-14 01:10:16,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268369 conditions, 63312 events. 41442/63312 cut-off events. For 459283/459471 co-relation queries the response was YES. Maximal size of possible extension queue 2201. Compared 478300 event pairs, 4196 based on Foata normal form. 2166/65306 useless extension candidates. Maximal degree in co-relation 268331. Up to 10259 conditions per place. [2025-03-14 01:10:16,932 INFO L140 encePairwiseOnDemand]: 28/42 looper letters, 745 selfloop transitions, 185 changer transitions 15/951 dead transitions. [2025-03-14 01:10:16,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 951 transitions, 9839 flow [2025-03-14 01:10:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-14 01:10:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-14 01:10:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 940 transitions. [2025-03-14 01:10:16,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43040293040293043 [2025-03-14 01:10:16,935 INFO L175 Difference]: Start difference. First operand has 137 places, 167 transitions, 1422 flow. Second operand 52 states and 940 transitions. [2025-03-14 01:10:16,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 951 transitions, 9839 flow [2025-03-14 01:10:20,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 951 transitions, 9032 flow, removed 394 selfloop flow, removed 9 redundant places. [2025-03-14 01:10:20,038 INFO L231 Difference]: Finished difference. Result has 200 places, 298 transitions, 3390 flow [2025-03-14 01:10:20,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=3390, PETRI_PLACES=200, PETRI_TRANSITIONS=298} [2025-03-14 01:10:20,039 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places. [2025-03-14 01:10:20,039 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 298 transitions, 3390 flow [2025-03-14 01:10:20,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.96875) internal successors, (319), 32 states have internal predecessors, (319), 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-03-14 01:10:20,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:10:20,039 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:10:20,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 01:10:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 01:10:20,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:10:20,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:10:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1604152516, now seen corresponding path program 4 times [2025-03-14 01:10:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:10:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606227592] [2025-03-14 01:10:20,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:10:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:10:20,249 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:10:20,263 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:10:20,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:10:20,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:10:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606227592] [2025-03-14 01:10:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606227592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:10:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46285681] [2025-03-14 01:10:20,678 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:10:20,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:10:20,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:10:20,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:10:20,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:10:20,742 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-14 01:10:20,769 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:10:20,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:10:20,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:10:20,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-14 01:10:20,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:10:21,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:10:21,040 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 30 treesize of output 26 [2025-03-14 01:10:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:21,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:10:21,305 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-03-14 01:10:21,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 102 [2025-03-14 01:10:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:10:21,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46285681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:10:21,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:10:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-14 01:10:21,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681176770] [2025-03-14 01:10:21,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:10:21,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-14 01:10:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:10:21,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-14 01:10:21,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-03-14 01:10:21,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-03-14 01:10:21,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 298 transitions, 3390 flow. Second operand has 31 states, 31 states have (on average 9.838709677419354) internal successors, (305), 31 states have internal predecessors, (305), 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-03-14 01:10:21,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:10:21,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-03-14 01:10:21,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:10:26,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:10:32,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:10:36,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:10:40,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:10:44,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:10:49,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:10:53,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:10:57,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:11:01,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:11:05,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:11:09,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:11:13,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-14 01:11:18,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]