./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.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/chl-nzb-file-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:01:37,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:01:37,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:01:37,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:01:37,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:01:37,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:01:37,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:01:37,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:01:37,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:01:37,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:01:37,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:01:37,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:01:37,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:01:37,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:01:37,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:01:37,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:01:37,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:01:37,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:01:37,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:01:37,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:01:37,133 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-03-14 01:01:37,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:01:37,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:01:37,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:01:37,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:01:37,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:01:37,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-14 01:01:38,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc642eff6/00860efaa67f438eade08ce7a06ffc3e/FLAGaa23d387a [2025-03-14 01:01:38,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:01:38,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-14 01:01:38,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc642eff6/00860efaa67f438eade08ce7a06ffc3e/FLAGaa23d387a [2025-03-14 01:01:38,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc642eff6/00860efaa67f438eade08ce7a06ffc3e [2025-03-14 01:01:38,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:01:38,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:01:38,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:01:38,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:01:38,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:01:38,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:01:38" (1/1) ... [2025-03-14 01:01:38,867 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:01:38, skipping insertion in model container [2025-03-14 01:01:38,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:01:38" (1/1) ... [2025-03-14 01:01:38,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:01:39,041 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/chl-nzb-file-symm.wvr.c[4955,4968] [2025-03-14 01:01:39,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:01:39,061 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:01:39,089 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/chl-nzb-file-symm.wvr.c[4955,4968] [2025-03-14 01:01:39,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:01:39,116 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:01:39,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39 WrapperNode [2025-03-14 01:01:39,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:01:39,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:01:39,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:01:39,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:01:39,123 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:01:39" (1/1) ... [2025-03-14 01:01:39,133 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:01:39" (1/1) ... [2025-03-14 01:01:39,155 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-03-14 01:01:39,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:01:39,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:01:39,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:01:39,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:01:39,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,189 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 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:01:39,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:01:39,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:01:39,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:01:39,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:01:39,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (1/1) ... [2025-03-14 01:01:39,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:01:39,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:39,241 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:01:39,245 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:01:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:01:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:01:39,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:01:39,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:01:39,268 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:01:39,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:01:39,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:01:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:01:39,270 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:01:39,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:01:39,372 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:01:39,867 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:01:39,868 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:01:39,868 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:01:40,424 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:01:40,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:01:40 BoogieIcfgContainer [2025-03-14 01:01:40,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:01:40,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:01:40,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:01:40,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:01:40,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:01:38" (1/3) ... [2025-03-14 01:01:40,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efd11e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:01:40, skipping insertion in model container [2025-03-14 01:01:40,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:01:39" (2/3) ... [2025-03-14 01:01:40,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4efd11e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:01:40, skipping insertion in model container [2025-03-14 01:01:40,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:01:40" (3/3) ... [2025-03-14 01:01:40,434 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-03-14 01:01:40,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:01:40,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 01:01:40,451 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:01:40,518 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:01:40,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 82 flow [2025-03-14 01:01:40,565 INFO L124 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-03-14 01:01:40,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:01:40,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 8/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-14 01:01:40,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 82 flow [2025-03-14 01:01:40,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 74 flow [2025-03-14 01:01:40,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:01:40,598 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;@40c52c47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:01:40,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:01:40,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:01:40,621 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2025-03-14 01:01:40,621 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:01:40,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:40,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:40,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:40,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash -606871496, now seen corresponding path program 1 times [2025-03-14 01:01:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504385813] [2025-03-14 01:01:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:40,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:01:40,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:01:40,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:40,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:41,064 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:01:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:41,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504385813] [2025-03-14 01:01:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504385813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:41,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:01:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494338729] [2025-03-14 01:01:41,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:01:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:41,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:01:41,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:01:41,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:41,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:01:41,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:41,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:41,283 INFO L124 PetriNetUnfolderBase]: 202/329 cut-off events. [2025-03-14 01:01:41,284 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:01:41,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 329 events. 202/329 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1004 event pairs, 138 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 620. Up to 327 conditions per place. [2025-03-14 01:01:41,289 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 26 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-03-14 01:01:41,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 134 flow [2025-03-14 01:01:41,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:01:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:01:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-14 01:01:41,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2025-03-14 01:01:41,302 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 74 flow. Second operand 3 states and 43 transitions. [2025-03-14 01:01:41,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 134 flow [2025-03-14 01:01:41,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:01:41,309 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 84 flow [2025-03-14 01:01:41,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2025-03-14 01:01:41,315 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-03-14 01:01:41,315 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 84 flow [2025-03-14 01:01:41,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:01:41,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:41,316 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:01:41,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:41,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash -381221047, now seen corresponding path program 1 times [2025-03-14 01:01:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623878391] [2025-03-14 01:01:41,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:41,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:01:41,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:01:41,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:41,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:41,517 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:01:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623878391] [2025-03-14 01:01:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623878391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535788846] [2025-03-14 01:01:41,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:41,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:41,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:41,520 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:01:41,522 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:01:41,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:01:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:01:41,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:41,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:41,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-14 01:01:41,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:41,714 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:01:41,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:41,735 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:01:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535788846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:41,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:41,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-14 01:01:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50998176] [2025-03-14 01:01:41,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:41,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:01:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:41,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:01:41,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:01:41,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:41,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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:01:41,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:41,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:41,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:41,910 INFO L124 PetriNetUnfolderBase]: 202/335 cut-off events. [2025-03-14 01:01:41,910 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:01:41,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 335 events. 202/335 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1007 event pairs, 138 based on Foata normal form. 3/275 useless extension candidates. Maximal degree in co-relation 666. Up to 327 conditions per place. [2025-03-14 01:01:41,915 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2025-03-14 01:01:41,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 180 flow [2025-03-14 01:01:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:01:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:01:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-03-14 01:01:41,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-03-14 01:01:41,917 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 84 flow. Second operand 6 states and 60 transitions. [2025-03-14 01:01:41,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 180 flow [2025-03-14 01:01:41,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:01:41,918 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 146 flow [2025-03-14 01:01:41,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-03-14 01:01:41,919 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-03-14 01:01:41,919 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 146 flow [2025-03-14 01:01:41,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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:01:41,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:41,919 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:41,927 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:01:42,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:42,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:42,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1648320970, now seen corresponding path program 2 times [2025-03-14 01:01:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561986421] [2025-03-14 01:01:42,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:42,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-14 01:01:42,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-03-14 01:01:42,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:01:42,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 01:01:42,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561986421] [2025-03-14 01:01:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561986421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:42,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:42,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:01:42,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795619854] [2025-03-14 01:01:42,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:42,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:01:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:42,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:01:42,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:01:42,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:42,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:42,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:42,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:42,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:43,199 INFO L124 PetriNetUnfolderBase]: 244/430 cut-off events. [2025-03-14 01:01:43,199 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:01:43,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 430 events. 244/430 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1536 event pairs, 138 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 848. Up to 319 conditions per place. [2025-03-14 01:01:43,203 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 45 selfloop transitions, 1 changer transitions 9/56 dead transitions. [2025-03-14 01:01:43,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 299 flow [2025-03-14 01:01:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:01:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:01:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-14 01:01:43,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4485294117647059 [2025-03-14 01:01:43,206 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 146 flow. Second operand 4 states and 61 transitions. [2025-03-14 01:01:43,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 299 flow [2025-03-14 01:01:43,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 283 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 01:01:43,209 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 139 flow [2025-03-14 01:01:43,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-03-14 01:01:43,210 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-03-14 01:01:43,210 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 139 flow [2025-03-14 01:01:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:43,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:43,210 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:43,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:01:43,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:43,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash -199162796, now seen corresponding path program 3 times [2025-03-14 01:01:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868799446] [2025-03-14 01:01:43,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:01:43,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:43,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-14 01:01:43,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-03-14 01:01:43,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:01:43,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 01:01:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868799446] [2025-03-14 01:01:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868799446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:01:43,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449877341] [2025-03-14 01:01:43,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:01:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:43,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:01:43,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:01:43,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:43,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:43,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:43,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:43,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:44,044 INFO L124 PetriNetUnfolderBase]: 272/491 cut-off events. [2025-03-14 01:01:44,044 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-14 01:01:44,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 491 events. 272/491 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1778 event pairs, 181 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1056. Up to 393 conditions per place. [2025-03-14 01:01:44,047 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 47 selfloop transitions, 1 changer transitions 6/55 dead transitions. [2025-03-14 01:01:44,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2025-03-14 01:01:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:01:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:01:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-14 01:01:44,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2025-03-14 01:01:44,050 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 139 flow. Second operand 4 states and 59 transitions. [2025-03-14 01:01:44,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2025-03-14 01:01:44,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 286 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-14 01:01:44,054 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 143 flow [2025-03-14 01:01:44,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-14 01:01:44,055 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-03-14 01:01:44,056 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 143 flow [2025-03-14 01:01:44,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:44,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:44,056 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:44,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:01:44,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:44,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1934564223, now seen corresponding path program 1 times [2025-03-14 01:01:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-03-14 01:01:44,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:44,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:44,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:01:44,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:01:44,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:44,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 01:01:44,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:44,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892007589] [2025-03-14 01:01:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892007589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:44,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:44,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:01:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556902593] [2025-03-14 01:01:44,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:44,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:01:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:44,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:01:44,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:01:44,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:44,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:44,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:44,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:44,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:44,237 INFO L124 PetriNetUnfolderBase]: 217/397 cut-off events. [2025-03-14 01:01:44,237 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-14 01:01:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 397 events. 217/397 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1328 event pairs, 73 based on Foata normal form. 21/382 useless extension candidates. Maximal degree in co-relation 857. Up to 320 conditions per place. [2025-03-14 01:01:44,239 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 41 selfloop transitions, 2 changer transitions 3/47 dead transitions. [2025-03-14 01:01:44,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 259 flow [2025-03-14 01:01:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:01:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:01:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-14 01:01:44,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-14 01:01:44,242 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 143 flow. Second operand 3 states and 49 transitions. [2025-03-14 01:01:44,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 259 flow [2025-03-14 01:01:44,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:01:44,243 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 154 flow [2025-03-14 01:01:44,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-14 01:01:44,244 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-03-14 01:01:44,244 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 154 flow [2025-03-14 01:01:44,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:44,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:44,244 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:44,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:01:44,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:44,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash 690666863, now seen corresponding path program 1 times [2025-03-14 01:01:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:44,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242955490] [2025-03-14 01:01:44,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:44,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:01:44,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:01:44,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:44,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-14 01:01:44,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242955490] [2025-03-14 01:01:44,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242955490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:44,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:44,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:01:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648830126] [2025-03-14 01:01:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:01:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:01:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:01:44,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:44,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:44,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:44,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:44,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:44,430 INFO L124 PetriNetUnfolderBase]: 179/320 cut-off events. [2025-03-14 01:01:44,430 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-14 01:01:44,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 320 events. 179/320 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 917 event pairs, 128 based on Foata normal form. 4/292 useless extension candidates. Maximal degree in co-relation 697. Up to 304 conditions per place. [2025-03-14 01:01:44,432 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 36 selfloop transitions, 0 changer transitions 4/41 dead transitions. [2025-03-14 01:01:44,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 240 flow [2025-03-14 01:01:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:01:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:01:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-03-14 01:01:44,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-03-14 01:01:44,436 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 154 flow. Second operand 3 states and 40 transitions. [2025-03-14 01:01:44,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 240 flow [2025-03-14 01:01:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 231 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-14 01:01:44,438 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 142 flow [2025-03-14 01:01:44,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-14 01:01:44,438 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-03-14 01:01:44,438 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 142 flow [2025-03-14 01:01:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:44,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:44,439 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 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:01:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:01:44,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -385319908, now seen corresponding path program 1 times [2025-03-14 01:01:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498350741] [2025-03-14 01:01:44,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:44,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:01:44,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:01:44,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:44,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:01:44,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498350741] [2025-03-14 01:01:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498350741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540513118] [2025-03-14 01:01:44,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:44,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:44,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:44,570 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:01:44,572 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:01:44,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:01:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:01:44,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:44,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:01:44,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:01:44,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-14 01:01:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540513118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:44,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:44,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 01:01:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308811567] [2025-03-14 01:01:44,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:44,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:01:44,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:44,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:01:44,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:01:44,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:44,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 142 flow. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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:01:44,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:44,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:44,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:44,920 INFO L124 PetriNetUnfolderBase]: 171/306 cut-off events. [2025-03-14 01:01:44,920 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-14 01:01:44,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 306 events. 171/306 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 841 event pairs, 128 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 696. Up to 296 conditions per place. [2025-03-14 01:01:44,922 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 12 changer transitions 0/39 dead transitions. [2025-03-14 01:01:44,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 230 flow [2025-03-14 01:01:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:01:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:01:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-03-14 01:01:44,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24789915966386555 [2025-03-14 01:01:44,923 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 142 flow. Second operand 7 states and 59 transitions. [2025-03-14 01:01:44,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 230 flow [2025-03-14 01:01:44,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:01:44,925 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 186 flow [2025-03-14 01:01:44,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-03-14 01:01:44,925 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-03-14 01:01:44,926 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 186 flow [2025-03-14 01:01:44,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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:01:44,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:44,926 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 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:01:44,936 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:01:45,126 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,SelfDestructingSolverStorable6 [2025-03-14 01:01:45,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1734148965, now seen corresponding path program 2 times [2025-03-14 01:01:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097714893] [2025-03-14 01:01:45,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:01:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:45,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-14 01:01:45,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 33 statements. [2025-03-14 01:01:45,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:01:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:01:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097714893] [2025-03-14 01:01:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097714893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:45,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:01:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532053097] [2025-03-14 01:01:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:01:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:45,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:01:45,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:01:45,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:45,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:45,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:45,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:45,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:45,320 INFO L124 PetriNetUnfolderBase]: 240/423 cut-off events. [2025-03-14 01:01:45,321 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-14 01:01:45,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 423 events. 240/423 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1301 event pairs, 139 based on Foata normal form. 16/386 useless extension candidates. Maximal degree in co-relation 950. Up to 306 conditions per place. [2025-03-14 01:01:45,324 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 47 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2025-03-14 01:01:45,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 317 flow [2025-03-14 01:01:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:01:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:01:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-14 01:01:45,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-14 01:01:45,325 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 186 flow. Second operand 3 states and 49 transitions. [2025-03-14 01:01:45,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 317 flow [2025-03-14 01:01:45,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 293 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-14 01:01:45,327 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 177 flow [2025-03-14 01:01:45,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-14 01:01:45,327 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2025-03-14 01:01:45,328 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 177 flow [2025-03-14 01:01:45,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:01:45,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:45,328 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:01:45,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -454404341, now seen corresponding path program 1 times [2025-03-14 01:01:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467331029] [2025-03-14 01:01:45,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:01:45,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:01:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:01:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467331029] [2025-03-14 01:01:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467331029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:01:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:01:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:01:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603634428] [2025-03-14 01:01:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:01:45,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:01:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:45,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:01:45,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:01:45,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:45,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:01:45,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:45,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:45,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:01:45,666 INFO L124 PetriNetUnfolderBase]: 333/579 cut-off events. [2025-03-14 01:01:45,667 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-14 01:01:45,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 579 events. 333/579 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1973 event pairs, 191 based on Foata normal form. 21/558 useless extension candidates. Maximal degree in co-relation 1366. Up to 423 conditions per place. [2025-03-14 01:01:45,671 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 48 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2025-03-14 01:01:45,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 320 flow [2025-03-14 01:01:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:01:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:01:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-14 01:01:45,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-14 01:01:45,673 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 177 flow. Second operand 3 states and 48 transitions. [2025-03-14 01:01:45,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 320 flow [2025-03-14 01:01:45,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:01:45,675 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 189 flow [2025-03-14 01:01:45,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-03-14 01:01:45,678 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-03-14 01:01:45,678 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 189 flow [2025-03-14 01:01:45,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:01:45,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:01:45,678 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:01:45,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:01:45,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:01:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:01:45,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2043684236, now seen corresponding path program 1 times [2025-03-14 01:01:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:01:45,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28345961] [2025-03-14 01:01:45,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:45,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:01:45,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:01:45,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:01:45,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:01:51,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:01:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28345961] [2025-03-14 01:01:51,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28345961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:01:51,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271270014] [2025-03-14 01:01:51,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:01:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:01:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:01:51,921 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:01:51,922 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:01:52,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:01:52,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:01:52,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:01:52,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:01:52,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-14 01:01:52,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:01:53,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:01:53,057 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 326 treesize of output 278 [2025-03-14 01:01:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:01:53,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:01:55,981 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-03-14 01:01:55,981 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 325 treesize of output 302 [2025-03-14 01:01:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:01:56,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271270014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:01:56,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:01:56,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 35 [2025-03-14 01:01:56,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752328346] [2025-03-14 01:01:56,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:01:56,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-14 01:01:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:01:56,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-14 01:01:56,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2025-03-14 01:01:56,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:01:56,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 189 flow. Second operand has 35 states, 35 states have (on average 5.371428571428571) internal successors, (188), 35 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:01:56,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:01:56,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:01:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:02:00,667 INFO L124 PetriNetUnfolderBase]: 1378/2371 cut-off events. [2025-03-14 01:02:00,668 INFO L125 PetriNetUnfolderBase]: For 803/803 co-relation queries the response was YES. [2025-03-14 01:02:00,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 2371 events. 1378/2371 cut-off events. For 803/803 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12201 event pairs, 266 based on Foata normal form. 2/2373 useless extension candidates. Maximal degree in co-relation 5778. Up to 416 conditions per place. [2025-03-14 01:02:00,679 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 201 selfloop transitions, 82 changer transitions 34/318 dead transitions. [2025-03-14 01:02:00,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 318 transitions, 1691 flow [2025-03-14 01:02:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-14 01:02:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-14 01:02:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 433 transitions. [2025-03-14 01:02:00,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30322128851540614 [2025-03-14 01:02:00,682 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 189 flow. Second operand 42 states and 433 transitions. [2025-03-14 01:02:00,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 318 transitions, 1691 flow [2025-03-14 01:02:00,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 318 transitions, 1661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:02:00,690 INFO L231 Difference]: Finished difference. Result has 95 places, 113 transitions, 781 flow [2025-03-14 01:02:00,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=781, PETRI_PLACES=95, PETRI_TRANSITIONS=113} [2025-03-14 01:02:00,691 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2025-03-14 01:02:00,691 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 113 transitions, 781 flow [2025-03-14 01:02:00,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.371428571428571) internal successors, (188), 35 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:02:00,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:02:00,691 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:02:00,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:02:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:02:00,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:02:00,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:02:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 277062124, now seen corresponding path program 2 times [2025-03-14 01:02:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:02:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254605371] [2025-03-14 01:02:00,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:02:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:02:00,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-14 01:02:01,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:02:01,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:02:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:02:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:02:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:02:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254605371] [2025-03-14 01:02:06,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254605371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:02:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457911676] [2025-03-14 01:02:06,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:02:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:02:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:02:06,141 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:02:06,142 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:02:06,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-14 01:02:06,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:02:06,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:02:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:02:06,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 01:02:06,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:02:07,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:02:07,513 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 345 treesize of output 281 [2025-03-14 01:02:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:02:08,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:02:09,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:02:09,880 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 417 treesize of output 395 [2025-03-14 01:02:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:02:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457911676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:02:11,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:02:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 8] total 38 [2025-03-14 01:02:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901527201] [2025-03-14 01:02:11,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:02:11,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-14 01:02:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:02:11,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-14 01:02:11,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2025-03-14 01:02:11,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:02:11,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 113 transitions, 781 flow. Second operand has 38 states, 38 states have (on average 5.421052631578948) internal successors, (206), 38 states have internal predecessors, (206), 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:02:11,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:02:11,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:02:11,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:02:15,137 INFO L124 PetriNetUnfolderBase]: 2300/4062 cut-off events. [2025-03-14 01:02:15,138 INFO L125 PetriNetUnfolderBase]: For 7487/7487 co-relation queries the response was YES. [2025-03-14 01:02:15,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12022 conditions, 4062 events. 2300/4062 cut-off events. For 7487/7487 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 24097 event pairs, 378 based on Foata normal form. 4/4066 useless extension candidates. Maximal degree in co-relation 12000. Up to 941 conditions per place. [2025-03-14 01:02:15,157 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 141 selfloop transitions, 104 changer transitions 27/273 dead transitions. [2025-03-14 01:02:15,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 273 transitions, 2063 flow [2025-03-14 01:02:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 01:02:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 01:02:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 262 transitions. [2025-03-14 01:02:15,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27521008403361347 [2025-03-14 01:02:15,159 INFO L175 Difference]: Start difference. First operand has 95 places, 113 transitions, 781 flow. Second operand 28 states and 262 transitions. [2025-03-14 01:02:15,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 273 transitions, 2063 flow [2025-03-14 01:02:15,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 273 transitions, 1793 flow, removed 94 selfloop flow, removed 13 redundant places. [2025-03-14 01:02:15,193 INFO L231 Difference]: Finished difference. Result has 114 places, 155 transitions, 1198 flow [2025-03-14 01:02:15,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1198, PETRI_PLACES=114, PETRI_TRANSITIONS=155} [2025-03-14 01:02:15,194 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2025-03-14 01:02:15,195 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 155 transitions, 1198 flow [2025-03-14 01:02:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.421052631578948) internal successors, (206), 38 states have internal predecessors, (206), 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:02:15,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:02:15,195 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:02:15,204 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:02:15,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:02:15,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:02:15,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:02:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1919740916, now seen corresponding path program 3 times [2025-03-14 01:02:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:02:15,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152090531] [2025-03-14 01:02:15,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:02:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:02:15,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-14 01:02:15,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 37 statements. [2025-03-14 01:02:15,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:02:15,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:02:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-14 01:02:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:02:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152090531] [2025-03-14 01:02:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152090531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:02:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:02:18,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 01:02:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457463569] [2025-03-14 01:02:18,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:02:18,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:02:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:02:18,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:02:18,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:02:18,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-14 01:02:18,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 155 transitions, 1198 flow. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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:02:18,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:02:18,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-14 01:02:18,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:02:19,259 INFO L124 PetriNetUnfolderBase]: 2644/4676 cut-off events. [2025-03-14 01:02:19,259 INFO L125 PetriNetUnfolderBase]: For 16790/16790 co-relation queries the response was YES. [2025-03-14 01:02:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15271 conditions, 4676 events. 2644/4676 cut-off events. For 16790/16790 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 29147 event pairs, 1448 based on Foata normal form. 2/4678 useless extension candidates. Maximal degree in co-relation 15248. Up to 3321 conditions per place. [2025-03-14 01:02:19,284 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 173 selfloop transitions, 45 changer transitions 14/233 dead transitions. [2025-03-14 01:02:19,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 233 transitions, 2051 flow [2025-03-14 01:02:19,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:02:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:02:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 140 transitions. [2025-03-14 01:02:19,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3167420814479638 [2025-03-14 01:02:19,285 INFO L175 Difference]: Start difference. First operand has 114 places, 155 transitions, 1198 flow. Second operand 13 states and 140 transitions. [2025-03-14 01:02:19,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 233 transitions, 2051 flow [2025-03-14 01:02:19,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1962 flow, removed 40 selfloop flow, removed 4 redundant places. [2025-03-14 01:02:19,398 INFO L231 Difference]: Finished difference. Result has 124 places, 172 transitions, 1419 flow [2025-03-14 01:02:19,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1419, PETRI_PLACES=124, PETRI_TRANSITIONS=172} [2025-03-14 01:02:19,399 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2025-03-14 01:02:19,399 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 172 transitions, 1419 flow [2025-03-14 01:02:19,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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:02:19,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:02:19,399 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:02:19,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:02:19,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:02:19,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:02:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash -279621632, now seen corresponding path program 4 times [2025-03-14 01:02:19,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:02:19,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077725407] [2025-03-14 01:02:19,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:02:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:02:19,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-14 01:02:19,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:02:19,486 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:02:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:02:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:02:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:02:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077725407] [2025-03-14 01:02:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077725407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:02:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298837089] [2025-03-14 01:02:24,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:02:24,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:02:24,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:02:24,376 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:02:24,377 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:02:24,487 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-14 01:02:24,528 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:02:24,528 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:02:24,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:02:24,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-14 01:02:24,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:02:24,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 30 [2025-03-14 01:02:24,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-14 01:02:24,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-14 01:02:24,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 62 treesize of output 46 [2025-03-14 01:02:24,620 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2025-03-14 01:02:24,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-03-14 01:02:24,642 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-14 01:02:24,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2025-03-14 01:02:24,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 114 treesize of output 90 [2025-03-14 01:02:24,794 INFO L349 Elim1Store]: treesize reduction 127, result has 18.1 percent of original size [2025-03-14 01:02:24,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 117 [2025-03-14 01:02:24,910 INFO L349 Elim1Store]: treesize reduction 76, result has 39.7 percent of original size [2025-03-14 01:02:24,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 101 [2025-03-14 01:02:25,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 236 treesize of output 192 [2025-03-14 01:02:25,857 INFO L349 Elim1Store]: treesize reduction 377, result has 45.8 percent of original size [2025-03-14 01:02:25,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 54 case distinctions, treesize of input 192 treesize of output 477