./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:13:52,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:13:52,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:13:52,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:13:52,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:13:52,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:13:52,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:13:52,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:13:52,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:13:52,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:13:52,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:13:52,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:13:52,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:13:52,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:13:52,889 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:13:52,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:13:52,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:13:52,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:13:52,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:13:52,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:52,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:13:52,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:13:52,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:13:52,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:13:52,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 [2025-02-08 01:13:53,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:13:53,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:13:53,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:13:53,181 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:13:53,181 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:13:53,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-02-08 01:13:54,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfad7b25e/644cc0fb84524ee994cdc5bdca8f4ff2/FLAGe392244ed [2025-02-08 01:13:54,705 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:13:54,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2025-02-08 01:13:54,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfad7b25e/644cc0fb84524ee994cdc5bdca8f4ff2/FLAGe392244ed [2025-02-08 01:13:55,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bfad7b25e/644cc0fb84524ee994cdc5bdca8f4ff2 [2025-02-08 01:13:55,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:13:55,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:13:55,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:55,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:13:55,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:13:55,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e9e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55, skipping insertion in model container [2025-02-08 01:13:55,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:13:55,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c[2329,2342] [2025-02-08 01:13:55,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:55,212 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:13:55,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c[2329,2342] [2025-02-08 01:13:55,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:55,244 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:13:55,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55 WrapperNode [2025-02-08 01:13:55,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:55,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:55,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:13:55,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:13:55,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,283 INFO L138 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 115 [2025-02-08 01:13:55,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:55,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:13:55,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:13:55,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:13:55,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:13:55,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:13:55,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:13:55,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:13:55,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:13:55,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (1/1) ... [2025-02-08 01:13:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:55,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:55,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:13:55,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:13:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:13:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:13:55,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:13:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:13:55,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:13:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:13:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:13:55,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:13:55,384 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:13:55,454 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:13:55,455 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:13:55,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-5: #t~ite2#1 := #t~ret1#1; [2025-02-08 01:13:55,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 01:13:55,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:55,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:55,555 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L43-9: #t~ret1#1 := minus_#res#1; [2025-02-08 01:13:55,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-5: #t~ite5#1 := #t~ret4#1; [2025-02-08 01:13:55,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 01:13:55,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:55,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:55,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-9: #t~ret4#1 := minus_#res#1; [2025-02-08 01:13:55,695 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:13:55,695 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:13:55,871 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:13:55,871 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:13:55,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:55 BoogieIcfgContainer [2025-02-08 01:13:55,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:13:55,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:13:55,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:13:55,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:13:55,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:13:55" (1/3) ... [2025-02-08 01:13:55,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5007fdc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:55, skipping insertion in model container [2025-02-08 01:13:55,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:55" (2/3) ... [2025-02-08 01:13:55,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5007fdc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:55, skipping insertion in model container [2025-02-08 01:13:55,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:55" (3/3) ... [2025-02-08 01:13:55,882 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2025-02-08 01:13:55,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:13:55,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-symm.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:13:55,893 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:13:55,950 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:13:55,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2025-02-08 01:13:56,018 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-02-08 01:13:56,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:56,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-08 01:13:56,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2025-02-08 01:13:56,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-02-08 01:13:56,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:13:56,052 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;@31b11b4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:13:56,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:13:56,069 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:13:56,069 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-02-08 01:13:56,070 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:13:56,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:56,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:56,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1442960448, now seen corresponding path program 1 times [2025-02-08 01:13:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:56,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657486052] [2025-02-08 01:13:56,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:56,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:13:56,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:13:56,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:56,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:56,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657486052] [2025-02-08 01:13:56,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657486052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:56,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:56,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503684452] [2025-02-08 01:13:56,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:56,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:56,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:56,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:56,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:56,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:56,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:56,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:56,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:57,126 INFO L124 PetriNetUnfolderBase]: 99/203 cut-off events. [2025-02-08 01:13:57,127 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 01:13:57,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 203 events. 99/203 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 858 event pairs, 31 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 357. Up to 70 conditions per place. [2025-02-08 01:13:57,133 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 33 selfloop transitions, 8 changer transitions 20/65 dead transitions. [2025-02-08 01:13:57,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 65 transitions, 291 flow [2025-02-08 01:13:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:13:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:13:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2025-02-08 01:13:57,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2025-02-08 01:13:57,149 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 11 states and 130 transitions. [2025-02-08 01:13:57,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 65 transitions, 291 flow [2025-02-08 01:13:57,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 65 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:57,157 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 97 flow [2025-02-08 01:13:57,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2025-02-08 01:13:57,162 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2025-02-08 01:13:57,162 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 97 flow [2025-02-08 01:13:57,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:57,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:57,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:57,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:13:57,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:57,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash 23658250, now seen corresponding path program 2 times [2025-02-08 01:13:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372317429] [2025-02-08 01:13:57,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:57,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:13:57,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:13:57,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:57,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:57,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:57,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372317429] [2025-02-08 01:13:57,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372317429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:57,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:57,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:57,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115034888] [2025-02-08 01:13:57,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:57,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:57,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:57,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:57,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:57,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:57,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:57,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:57,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:57,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:57,601 INFO L124 PetriNetUnfolderBase]: 79/167 cut-off events. [2025-02-08 01:13:57,601 INFO L125 PetriNetUnfolderBase]: For 208/211 co-relation queries the response was YES. [2025-02-08 01:13:57,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 167 events. 79/167 cut-off events. For 208/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 658 event pairs, 23 based on Foata normal form. 3/164 useless extension candidates. Maximal degree in co-relation 494. Up to 85 conditions per place. [2025-02-08 01:13:57,604 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 26 selfloop transitions, 13 changer transitions 6/49 dead transitions. [2025-02-08 01:13:57,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 284 flow [2025-02-08 01:13:57,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2025-02-08 01:13:57,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 01:13:57,607 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 97 flow. Second operand 7 states and 84 transitions. [2025-02-08 01:13:57,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 284 flow [2025-02-08 01:13:57,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 49 transitions, 264 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:57,612 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 178 flow [2025-02-08 01:13:57,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-02-08 01:13:57,614 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2025-02-08 01:13:57,614 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 178 flow [2025-02-08 01:13:57,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:57,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:57,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:57,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:13:57,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash -854705852, now seen corresponding path program 3 times [2025-02-08 01:13:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:57,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316837251] [2025-02-08 01:13:57,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:57,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:13:57,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:13:57,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:57,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:57,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316837251] [2025-02-08 01:13:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316837251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:57,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:57,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566216157] [2025-02-08 01:13:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:57,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:57,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:57,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:57,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:57,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:57,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:57,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:57,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:57,961 INFO L124 PetriNetUnfolderBase]: 75/160 cut-off events. [2025-02-08 01:13:57,961 INFO L125 PetriNetUnfolderBase]: For 259/265 co-relation queries the response was YES. [2025-02-08 01:13:57,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 160 events. 75/160 cut-off events. For 259/265 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 625 event pairs, 22 based on Foata normal form. 5/159 useless extension candidates. Maximal degree in co-relation 512. Up to 83 conditions per place. [2025-02-08 01:13:57,965 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 25 selfloop transitions, 10 changer transitions 7/46 dead transitions. [2025-02-08 01:13:57,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 294 flow [2025-02-08 01:13:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-02-08 01:13:57,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-02-08 01:13:57,966 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 178 flow. Second operand 7 states and 82 transitions. [2025-02-08 01:13:57,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 294 flow [2025-02-08 01:13:57,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 284 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:57,972 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 171 flow [2025-02-08 01:13:57,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2025-02-08 01:13:57,973 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-02-08 01:13:57,973 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 171 flow [2025-02-08 01:13:57,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:57,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:57,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:57,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:13:57,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:57,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:57,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1185126288, now seen corresponding path program 4 times [2025-02-08 01:13:57,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:57,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911671654] [2025-02-08 01:13:57,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:57,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-02-08 01:13:57,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-02-08 01:13:57,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:13:57,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:58,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:58,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911671654] [2025-02-08 01:13:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911671654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:58,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:58,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:13:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401305513] [2025-02-08 01:13:58,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:58,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:13:58,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:58,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:13:58,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:13:58,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:58,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:58,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:58,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:58,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:58,319 INFO L124 PetriNetUnfolderBase]: 75/168 cut-off events. [2025-02-08 01:13:58,319 INFO L125 PetriNetUnfolderBase]: For 302/308 co-relation queries the response was YES. [2025-02-08 01:13:58,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 168 events. 75/168 cut-off events. For 302/308 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 675 event pairs, 22 based on Foata normal form. 5/167 useless extension candidates. Maximal degree in co-relation 490. Up to 76 conditions per place. [2025-02-08 01:13:58,324 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 31 selfloop transitions, 10 changer transitions 6/51 dead transitions. [2025-02-08 01:13:58,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 326 flow [2025-02-08 01:13:58,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2025-02-08 01:13:58,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-02-08 01:13:58,326 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 171 flow. Second operand 8 states and 93 transitions. [2025-02-08 01:13:58,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 326 flow [2025-02-08 01:13:58,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 286 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:58,330 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 163 flow [2025-02-08 01:13:58,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=163, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2025-02-08 01:13:58,331 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2025-02-08 01:13:58,331 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 163 flow [2025-02-08 01:13:58,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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-02-08 01:13:58,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:58,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:58,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:13:58,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:58,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash -809787244, now seen corresponding path program 1 times [2025-02-08 01:13:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488461363] [2025-02-08 01:13:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:58,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:13:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:13:58,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:58,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488461363] [2025-02-08 01:13:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488461363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:58,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:13:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145412688] [2025-02-08 01:13:58,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:58,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:13:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:58,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:13:58,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:58,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:58,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:58,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:58,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:58,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:58,621 INFO L124 PetriNetUnfolderBase]: 81/181 cut-off events. [2025-02-08 01:13:58,621 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-02-08 01:13:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 181 events. 81/181 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 737 event pairs, 53 based on Foata normal form. 1/176 useless extension candidates. Maximal degree in co-relation 596. Up to 135 conditions per place. [2025-02-08 01:13:58,626 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 27 selfloop transitions, 9 changer transitions 7/47 dead transitions. [2025-02-08 01:13:58,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 323 flow [2025-02-08 01:13:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-02-08 01:13:58,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-08 01:13:58,627 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 163 flow. Second operand 7 states and 77 transitions. [2025-02-08 01:13:58,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 323 flow [2025-02-08 01:13:58,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 291 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:58,633 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 203 flow [2025-02-08 01:13:58,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2025-02-08 01:13:58,634 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2025-02-08 01:13:58,634 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 203 flow [2025-02-08 01:13:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:58,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:58,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:58,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:13:58,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:58,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1155819212, now seen corresponding path program 2 times [2025-02-08 01:13:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615550334] [2025-02-08 01:13:58,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:58,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:13:58,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:13:58,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:58,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:58,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615550334] [2025-02-08 01:13:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615550334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:58,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:58,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:13:58,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092690082] [2025-02-08 01:13:58,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:58,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:13:58,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:58,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:13:58,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:58,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:58,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 203 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:58,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:58,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:58,909 INFO L124 PetriNetUnfolderBase]: 81/183 cut-off events. [2025-02-08 01:13:58,910 INFO L125 PetriNetUnfolderBase]: For 351/351 co-relation queries the response was YES. [2025-02-08 01:13:58,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 183 events. 81/183 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 762 event pairs, 41 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 632. Up to 100 conditions per place. [2025-02-08 01:13:58,912 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 34 selfloop transitions, 6 changer transitions 12/56 dead transitions. [2025-02-08 01:13:58,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 385 flow [2025-02-08 01:13:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-02-08 01:13:58,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-02-08 01:13:58,914 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 203 flow. Second operand 7 states and 83 transitions. [2025-02-08 01:13:58,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 385 flow [2025-02-08 01:13:58,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 369 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:58,918 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 217 flow [2025-02-08 01:13:58,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-02-08 01:13:58,920 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-02-08 01:13:58,920 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 217 flow [2025-02-08 01:13:58,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:58,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:58,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:13:58,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1180327144, now seen corresponding path program 1 times [2025-02-08 01:13:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986473336] [2025-02-08 01:13:58,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:13:58,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:13:58,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:58,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986473336] [2025-02-08 01:13:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986473336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:13:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619245964] [2025-02-08 01:13:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:13:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:59,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:13:59,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:59,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:59,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 217 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:59,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:59,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:59,179 INFO L124 PetriNetUnfolderBase]: 75/178 cut-off events. [2025-02-08 01:13:59,179 INFO L125 PetriNetUnfolderBase]: For 579/587 co-relation queries the response was YES. [2025-02-08 01:13:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 178 events. 75/178 cut-off events. For 579/587 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 693 event pairs, 25 based on Foata normal form. 12/185 useless extension candidates. Maximal degree in co-relation 627. Up to 76 conditions per place. [2025-02-08 01:13:59,181 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 40 selfloop transitions, 5 changer transitions 9/59 dead transitions. [2025-02-08 01:13:59,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 431 flow [2025-02-08 01:13:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-02-08 01:13:59,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2025-02-08 01:13:59,183 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 217 flow. Second operand 7 states and 86 transitions. [2025-02-08 01:13:59,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 431 flow [2025-02-08 01:13:59,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 413 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:59,187 INFO L231 Difference]: Finished difference. Result has 55 places, 33 transitions, 223 flow [2025-02-08 01:13:59,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=33} [2025-02-08 01:13:59,188 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 29 predicate places. [2025-02-08 01:13:59,188 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 33 transitions, 223 flow [2025-02-08 01:13:59,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:59,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:59,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:13:59,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:59,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:59,189 INFO L85 PathProgramCache]: Analyzing trace with hash -681654462, now seen corresponding path program 3 times [2025-02-08 01:13:59,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:59,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507755453] [2025-02-08 01:13:59,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:59,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:59,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:13:59,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:13:59,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:59,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:59,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507755453] [2025-02-08 01:13:59,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507755453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:59,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:59,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:13:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409956567] [2025-02-08 01:13:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:59,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:13:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:59,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:13:59,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:59,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:59,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 33 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:59,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:59,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:59,425 INFO L124 PetriNetUnfolderBase]: 60/161 cut-off events. [2025-02-08 01:13:59,426 INFO L125 PetriNetUnfolderBase]: For 512/519 co-relation queries the response was YES. [2025-02-08 01:13:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 161 events. 60/161 cut-off events. For 512/519 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 668 event pairs, 25 based on Foata normal form. 7/162 useless extension candidates. Maximal degree in co-relation 624. Up to 65 conditions per place. [2025-02-08 01:13:59,429 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 34 selfloop transitions, 6 changer transitions 10/54 dead transitions. [2025-02-08 01:13:59,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 431 flow [2025-02-08 01:13:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-02-08 01:13:59,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-02-08 01:13:59,431 INFO L175 Difference]: Start difference. First operand has 55 places, 33 transitions, 223 flow. Second operand 7 states and 82 transitions. [2025-02-08 01:13:59,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 431 flow [2025-02-08 01:13:59,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 393 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:59,435 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 223 flow [2025-02-08 01:13:59,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2025-02-08 01:13:59,436 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-02-08 01:13:59,436 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 223 flow [2025-02-08 01:13:59,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:59,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:59,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:13:59,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:59,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash -979569046, now seen corresponding path program 4 times [2025-02-08 01:13:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368643168] [2025-02-08 01:13:59,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:59,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-08 01:13:59,451 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-02-08 01:13:59,451 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:13:59,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:59,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:59,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368643168] [2025-02-08 01:13:59,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368643168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:59,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:59,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:13:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054624776] [2025-02-08 01:13:59,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:59,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:13:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:59,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:13:59,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:59,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:59,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:59,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:59,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:59,683 INFO L124 PetriNetUnfolderBase]: 45/128 cut-off events. [2025-02-08 01:13:59,683 INFO L125 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2025-02-08 01:13:59,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 128 events. 45/128 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 485 event pairs, 9 based on Foata normal form. 1/126 useless extension candidates. Maximal degree in co-relation 494. Up to 45 conditions per place. [2025-02-08 01:13:59,684 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 28 selfloop transitions, 11 changer transitions 9/52 dead transitions. [2025-02-08 01:13:59,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 52 transitions, 409 flow [2025-02-08 01:13:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:59,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-02-08 01:13:59,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2025-02-08 01:13:59,689 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 223 flow. Second operand 7 states and 81 transitions. [2025-02-08 01:13:59,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 52 transitions, 409 flow [2025-02-08 01:13:59,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 376 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:59,696 INFO L231 Difference]: Finished difference. Result has 59 places, 34 transitions, 260 flow [2025-02-08 01:13:59,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=59, PETRI_TRANSITIONS=34} [2025-02-08 01:13:59,697 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-02-08 01:13:59,697 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 34 transitions, 260 flow [2025-02-08 01:13:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:59,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:13:59,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:59,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 487644280, now seen corresponding path program 2 times [2025-02-08 01:13:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105148281] [2025-02-08 01:13:59,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:59,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:13:59,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:13:59,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:59,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:13:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105148281] [2025-02-08 01:13:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105148281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:59,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:13:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942542977] [2025-02-08 01:13:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:59,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:13:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:59,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:13:59,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:59,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:13:59,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 34 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:59,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:13:59,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:59,980 INFO L124 PetriNetUnfolderBase]: 53/140 cut-off events. [2025-02-08 01:13:59,980 INFO L125 PetriNetUnfolderBase]: For 535/539 co-relation queries the response was YES. [2025-02-08 01:13:59,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 140 events. 53/140 cut-off events. For 535/539 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 534 event pairs, 20 based on Foata normal form. 3/139 useless extension candidates. Maximal degree in co-relation 582. Up to 67 conditions per place. [2025-02-08 01:13:59,982 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 36 selfloop transitions, 7 changer transitions 7/55 dead transitions. [2025-02-08 01:13:59,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 462 flow [2025-02-08 01:13:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:13:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:13:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-02-08 01:13:59,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:13:59,983 INFO L175 Difference]: Start difference. First operand has 59 places, 34 transitions, 260 flow. Second operand 7 states and 80 transitions. [2025-02-08 01:13:59,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 462 flow [2025-02-08 01:13:59,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 420 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:59,988 INFO L231 Difference]: Finished difference. Result has 58 places, 35 transitions, 258 flow [2025-02-08 01:13:59,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=58, PETRI_TRANSITIONS=35} [2025-02-08 01:13:59,988 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 32 predicate places. [2025-02-08 01:13:59,989 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 35 transitions, 258 flow [2025-02-08 01:13:59,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:59,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:59,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:59,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:13:59,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:13:59,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash -88534112, now seen corresponding path program 3 times [2025-02-08 01:13:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298857445] [2025-02-08 01:13:59,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:59,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:59,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:13:59,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:13:59,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:59,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:00,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298857445] [2025-02-08 01:14:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298857445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:00,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868377639] [2025-02-08 01:14:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:00,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:00,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:00,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:00,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:00,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 35 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:00,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:00,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:00,236 INFO L124 PetriNetUnfolderBase]: 52/140 cut-off events. [2025-02-08 01:14:00,236 INFO L125 PetriNetUnfolderBase]: For 417/421 co-relation queries the response was YES. [2025-02-08 01:14:00,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 140 events. 52/140 cut-off events. For 417/421 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 540 event pairs, 19 based on Foata normal form. 3/139 useless extension candidates. Maximal degree in co-relation 558. Up to 67 conditions per place. [2025-02-08 01:14:00,237 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 33 selfloop transitions, 4 changer transitions 13/55 dead transitions. [2025-02-08 01:14:00,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 438 flow [2025-02-08 01:14:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-02-08 01:14:00,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:14:00,240 INFO L175 Difference]: Start difference. First operand has 58 places, 35 transitions, 258 flow. Second operand 7 states and 80 transitions. [2025-02-08 01:14:00,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 438 flow [2025-02-08 01:14:00,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 410 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:00,243 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 219 flow [2025-02-08 01:14:00,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2025-02-08 01:14:00,243 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-02-08 01:14:00,245 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 219 flow [2025-02-08 01:14:00,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:00,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:14:00,245 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -741085974, now seen corresponding path program 5 times [2025-02-08 01:14:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566389695] [2025-02-08 01:14:00,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:00,252 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:00,257 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:00,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:00,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566389695] [2025-02-08 01:14:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566389695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033045105] [2025-02-08 01:14:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:00,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:00,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:00,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:00,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:00,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 32 transitions, 219 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:00,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:00,490 INFO L124 PetriNetUnfolderBase]: 34/99 cut-off events. [2025-02-08 01:14:00,490 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2025-02-08 01:14:00,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 99 events. 34/99 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 332 event pairs, 15 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 403. Up to 59 conditions per place. [2025-02-08 01:14:00,491 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 21 selfloop transitions, 4 changer transitions 13/42 dead transitions. [2025-02-08 01:14:00,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 42 transitions, 324 flow [2025-02-08 01:14:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:00,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-02-08 01:14:00,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-02-08 01:14:00,492 INFO L175 Difference]: Start difference. First operand has 59 places, 32 transitions, 219 flow. Second operand 7 states and 74 transitions. [2025-02-08 01:14:00,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 42 transitions, 324 flow [2025-02-08 01:14:00,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 310 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:00,494 INFO L231 Difference]: Finished difference. Result has 56 places, 27 transitions, 173 flow [2025-02-08 01:14:00,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=56, PETRI_TRANSITIONS=27} [2025-02-08 01:14:00,495 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-02-08 01:14:00,495 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 27 transitions, 173 flow [2025-02-08 01:14:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:00,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:14:00,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -616993146, now seen corresponding path program 4 times [2025-02-08 01:14:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814040621] [2025-02-08 01:14:00,496 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:00,502 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-08 01:14:00,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-02-08 01:14:00,505 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:14:00,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:00,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:00,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814040621] [2025-02-08 01:14:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814040621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:00,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:00,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16293682] [2025-02-08 01:14:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:00,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:00,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:00,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:00,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:00,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 27 transitions, 173 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:00,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:00,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:00,736 INFO L124 PetriNetUnfolderBase]: 48/130 cut-off events. [2025-02-08 01:14:00,736 INFO L125 PetriNetUnfolderBase]: For 320/323 co-relation queries the response was YES. [2025-02-08 01:14:00,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 130 events. 48/130 cut-off events. For 320/323 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 472 event pairs, 13 based on Foata normal form. 3/130 useless extension candidates. Maximal degree in co-relation 487. Up to 48 conditions per place. [2025-02-08 01:14:00,737 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 38 selfloop transitions, 4 changer transitions 7/53 dead transitions. [2025-02-08 01:14:00,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 391 flow [2025-02-08 01:14:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-02-08 01:14:00,739 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2025-02-08 01:14:00,739 INFO L175 Difference]: Start difference. First operand has 56 places, 27 transitions, 173 flow. Second operand 7 states and 83 transitions. [2025-02-08 01:14:00,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 391 flow [2025-02-08 01:14:00,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 328 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-02-08 01:14:00,741 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 172 flow [2025-02-08 01:14:00,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2025-02-08 01:14:00,742 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2025-02-08 01:14:00,742 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 172 flow [2025-02-08 01:14:00,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:00,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:00,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:14:00,743 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:00,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash -417254160, now seen corresponding path program 5 times [2025-02-08 01:14:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:00,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775544354] [2025-02-08 01:14:00,743 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:00,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:00,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:00,751 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:00,751 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:00,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775544354] [2025-02-08 01:14:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775544354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:00,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:00,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756886209] [2025-02-08 01:14:00,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:00,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:00,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:00,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:00,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:00,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:00,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 30 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:00,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:00,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:00,988 INFO L124 PetriNetUnfolderBase]: 46/142 cut-off events. [2025-02-08 01:14:00,988 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-02-08 01:14:00,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 142 events. 46/142 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 579 event pairs, 3 based on Foata normal form. 1/139 useless extension candidates. Maximal degree in co-relation 486. Up to 53 conditions per place. [2025-02-08 01:14:00,990 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 26 selfloop transitions, 12 changer transitions 11/53 dead transitions. [2025-02-08 01:14:00,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 369 flow [2025-02-08 01:14:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:14:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:14:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-02-08 01:14:00,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-02-08 01:14:00,992 INFO L175 Difference]: Start difference. First operand has 50 places, 30 transitions, 172 flow. Second operand 9 states and 96 transitions. [2025-02-08 01:14:00,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 369 flow [2025-02-08 01:14:00,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 53 transitions, 357 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 01:14:00,996 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 236 flow [2025-02-08 01:14:00,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2025-02-08 01:14:00,997 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2025-02-08 01:14:00,997 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 236 flow [2025-02-08 01:14:00,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:00,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:00,998 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:00,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:14:00,998 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:00,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash -672008270, now seen corresponding path program 6 times [2025-02-08 01:14:00,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:00,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926207938] [2025-02-08 01:14:00,999 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,005 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:01,010 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:01,012 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:14:01,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926207938] [2025-02-08 01:14:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926207938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183186358] [2025-02-08 01:14:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:01,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:01,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:01,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:01,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:01,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 32 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:01,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:01,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:01,230 INFO L124 PetriNetUnfolderBase]: 39/123 cut-off events. [2025-02-08 01:14:01,230 INFO L125 PetriNetUnfolderBase]: For 444/450 co-relation queries the response was YES. [2025-02-08 01:14:01,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 123 events. 39/123 cut-off events. For 444/450 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 468 event pairs, 15 based on Foata normal form. 3/123 useless extension candidates. Maximal degree in co-relation 499. Up to 55 conditions per place. [2025-02-08 01:14:01,231 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 33 selfloop transitions, 5 changer transitions 8/50 dead transitions. [2025-02-08 01:14:01,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 415 flow [2025-02-08 01:14:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-02-08 01:14:01,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2025-02-08 01:14:01,232 INFO L175 Difference]: Start difference. First operand has 59 places, 32 transitions, 236 flow. Second operand 7 states and 79 transitions. [2025-02-08 01:14:01,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 415 flow [2025-02-08 01:14:01,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 387 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:01,235 INFO L231 Difference]: Finished difference. Result has 60 places, 33 transitions, 244 flow [2025-02-08 01:14:01,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=60, PETRI_TRANSITIONS=33} [2025-02-08 01:14:01,235 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 34 predicate places. [2025-02-08 01:14:01,235 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 33 transitions, 244 flow [2025-02-08 01:14:01,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:01,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:14:01,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:01,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1338552244, now seen corresponding path program 7 times [2025-02-08 01:14:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909299004] [2025-02-08 01:14:01,236 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:14:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:01,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:01,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:01,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909299004] [2025-02-08 01:14:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909299004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636242978] [2025-02-08 01:14:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:01,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:01,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:01,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:01,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 33 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:01,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:01,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:01,451 INFO L124 PetriNetUnfolderBase]: 36/120 cut-off events. [2025-02-08 01:14:01,451 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2025-02-08 01:14:01,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 120 events. 36/120 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 469 event pairs, 11 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 475. Up to 53 conditions per place. [2025-02-08 01:14:01,453 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 14 changer transitions 7/50 dead transitions. [2025-02-08 01:14:01,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 422 flow [2025-02-08 01:14:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-02-08 01:14:01,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2025-02-08 01:14:01,454 INFO L175 Difference]: Start difference. First operand has 60 places, 33 transitions, 244 flow. Second operand 7 states and 79 transitions. [2025-02-08 01:14:01,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 422 flow [2025-02-08 01:14:01,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 399 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:01,458 INFO L231 Difference]: Finished difference. Result has 62 places, 35 transitions, 296 flow [2025-02-08 01:14:01,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=62, PETRI_TRANSITIONS=35} [2025-02-08 01:14:01,459 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2025-02-08 01:14:01,460 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 35 transitions, 296 flow [2025-02-08 01:14:01,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:01,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:01,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:14:01,460 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:01,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -832879670, now seen corresponding path program 8 times [2025-02-08 01:14:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988394192] [2025-02-08 01:14:01,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:01,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:01,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:01,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988394192] [2025-02-08 01:14:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988394192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:01,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:01,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102193453] [2025-02-08 01:14:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:01,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:01,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:01,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:01,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:01,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 35 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:01,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:01,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:01,676 INFO L124 PetriNetUnfolderBase]: 33/105 cut-off events. [2025-02-08 01:14:01,677 INFO L125 PetriNetUnfolderBase]: For 420/430 co-relation queries the response was YES. [2025-02-08 01:14:01,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 105 events. 33/105 cut-off events. For 420/430 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 372 event pairs, 12 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 463. Up to 52 conditions per place. [2025-02-08 01:14:01,678 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 29 selfloop transitions, 1 changer transitions 14/48 dead transitions. [2025-02-08 01:14:01,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 418 flow [2025-02-08 01:14:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-02-08 01:14:01,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-02-08 01:14:01,679 INFO L175 Difference]: Start difference. First operand has 62 places, 35 transitions, 296 flow. Second operand 7 states and 77 transitions. [2025-02-08 01:14:01,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 418 flow [2025-02-08 01:14:01,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 48 transitions, 385 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:01,682 INFO L231 Difference]: Finished difference. Result has 62 places, 30 transitions, 216 flow [2025-02-08 01:14:01,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=216, PETRI_PLACES=62, PETRI_TRANSITIONS=30} [2025-02-08 01:14:01,684 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2025-02-08 01:14:01,684 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 30 transitions, 216 flow [2025-02-08 01:14:01,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:01,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:01,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:14:01,685 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:01,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1972273108, now seen corresponding path program 6 times [2025-02-08 01:14:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:01,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364779742] [2025-02-08 01:14:01,685 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,690 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:01,692 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:01,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:14:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364779742] [2025-02-08 01:14:01,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364779742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:01,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:01,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153691680] [2025-02-08 01:14:01,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:01,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:01,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:01,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:01,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 30 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:01,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:01,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:01,862 INFO L124 PetriNetUnfolderBase]: 29/95 cut-off events. [2025-02-08 01:14:01,862 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2025-02-08 01:14:01,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 95 events. 29/95 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 324 event pairs, 6 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 379. Up to 32 conditions per place. [2025-02-08 01:14:01,863 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 25 selfloop transitions, 8 changer transitions 7/44 dead transitions. [2025-02-08 01:14:01,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 44 transitions, 358 flow [2025-02-08 01:14:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2025-02-08 01:14:01,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-02-08 01:14:01,865 INFO L175 Difference]: Start difference. First operand has 62 places, 30 transitions, 216 flow. Second operand 7 states and 76 transitions. [2025-02-08 01:14:01,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 44 transitions, 358 flow [2025-02-08 01:14:01,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 44 transitions, 313 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:01,868 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 212 flow [2025-02-08 01:14:01,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2025-02-08 01:14:01,868 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 31 predicate places. [2025-02-08 01:14:01,868 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 212 flow [2025-02-08 01:14:01,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:01,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:01,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:14:01,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:01,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash 340438102, now seen corresponding path program 7 times [2025-02-08 01:14:01,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666438644] [2025-02-08 01:14:01,869 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:14:01,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:01,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:01,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:01,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:01,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666438644] [2025-02-08 01:14:01,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666438644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:01,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:01,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560189453] [2025-02-08 01:14:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:01,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:01,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:01,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:01,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:01,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:01,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:01,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:01,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:02,042 INFO L124 PetriNetUnfolderBase]: 26/91 cut-off events. [2025-02-08 01:14:02,042 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-02-08 01:14:02,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 91 events. 26/91 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 312 event pairs, 8 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 351. Up to 32 conditions per place. [2025-02-08 01:14:02,043 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 24 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2025-02-08 01:14:02,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 42 transitions, 322 flow [2025-02-08 01:14:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-02-08 01:14:02,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-02-08 01:14:02,044 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 212 flow. Second operand 7 states and 74 transitions. [2025-02-08 01:14:02,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 42 transitions, 322 flow [2025-02-08 01:14:02,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 298 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:02,048 INFO L231 Difference]: Finished difference. Result has 56 places, 28 transitions, 174 flow [2025-02-08 01:14:02,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=28} [2025-02-08 01:14:02,049 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 30 predicate places. [2025-02-08 01:14:02,049 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 28 transitions, 174 flow [2025-02-08 01:14:02,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:02,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:02,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:14:02,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:02,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:02,050 INFO L85 PathProgramCache]: Analyzing trace with hash 553561228, now seen corresponding path program 9 times [2025-02-08 01:14:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099518837] [2025-02-08 01:14:02,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:02,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:02,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:02,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:02,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099518837] [2025-02-08 01:14:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099518837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:02,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341053394] [2025-02-08 01:14:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:02,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:02,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:02,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:02,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 28 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:02,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:02,245 INFO L124 PetriNetUnfolderBase]: 20/76 cut-off events. [2025-02-08 01:14:02,245 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-02-08 01:14:02,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 76 events. 20/76 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 231 event pairs, 6 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 274. Up to 33 conditions per place. [2025-02-08 01:14:02,246 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 19 selfloop transitions, 8 changer transitions 9/40 dead transitions. [2025-02-08 01:14:02,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 40 transitions, 283 flow [2025-02-08 01:14:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:02,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-02-08 01:14:02,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2025-02-08 01:14:02,247 INFO L175 Difference]: Start difference. First operand has 56 places, 28 transitions, 174 flow. Second operand 7 states and 75 transitions. [2025-02-08 01:14:02,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 40 transitions, 283 flow [2025-02-08 01:14:02,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 258 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:02,249 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 149 flow [2025-02-08 01:14:02,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2025-02-08 01:14:02,250 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-02-08 01:14:02,250 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 25 transitions, 149 flow [2025-02-08 01:14:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:02,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:02,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 01:14:02,251 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1013097648, now seen corresponding path program 10 times [2025-02-08 01:14:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884482604] [2025-02-08 01:14:02,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:02,255 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-08 01:14:02,257 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-02-08 01:14:02,257 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:14:02,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884482604] [2025-02-08 01:14:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884482604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917802251] [2025-02-08 01:14:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:02,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:02,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:02,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 25 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:02,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:02,399 INFO L124 PetriNetUnfolderBase]: 16/61 cut-off events. [2025-02-08 01:14:02,399 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-02-08 01:14:02,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 61 events. 16/61 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 152 event pairs, 3 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 225. Up to 22 conditions per place. [2025-02-08 01:14:02,400 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 16 selfloop transitions, 5 changer transitions 11/36 dead transitions. [2025-02-08 01:14:02,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 244 flow [2025-02-08 01:14:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:02,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-02-08 01:14:02,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-02-08 01:14:02,401 INFO L175 Difference]: Start difference. First operand has 52 places, 25 transitions, 149 flow. Second operand 7 states and 72 transitions. [2025-02-08 01:14:02,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 244 flow [2025-02-08 01:14:02,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 220 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:14:02,402 INFO L231 Difference]: Finished difference. Result has 49 places, 20 transitions, 109 flow [2025-02-08 01:14:02,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=20} [2025-02-08 01:14:02,402 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-02-08 01:14:02,403 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 20 transitions, 109 flow [2025-02-08 01:14:02,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:02,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:02,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 01:14:02,403 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:02,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1622041084, now seen corresponding path program 8 times [2025-02-08 01:14:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917737810] [2025-02-08 01:14:02,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:02,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:02,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:02,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:02,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:14:02,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917737810] [2025-02-08 01:14:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917737810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:02,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957627487] [2025-02-08 01:14:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:02,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:02,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:02,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 20 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:02,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:02,538 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-02-08 01:14:02,539 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-02-08 01:14:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 44 events. 12/44 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 72 event pairs, 0 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 165. Up to 15 conditions per place. [2025-02-08 01:14:02,539 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 15 selfloop transitions, 4 changer transitions 7/29 dead transitions. [2025-02-08 01:14:02,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 29 transitions, 185 flow [2025-02-08 01:14:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2025-02-08 01:14:02,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2025-02-08 01:14:02,540 INFO L175 Difference]: Start difference. First operand has 49 places, 20 transitions, 109 flow. Second operand 7 states and 67 transitions. [2025-02-08 01:14:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 29 transitions, 185 flow [2025-02-08 01:14:02,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 154 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:02,541 INFO L231 Difference]: Finished difference. Result has 39 places, 18 transitions, 79 flow [2025-02-08 01:14:02,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=79, PETRI_PLACES=39, PETRI_TRANSITIONS=18} [2025-02-08 01:14:02,542 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2025-02-08 01:14:02,542 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 18 transitions, 79 flow [2025-02-08 01:14:02,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:02,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:02,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 01:14:02,542 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:02,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash 398378558, now seen corresponding path program 9 times [2025-02-08 01:14:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986374378] [2025-02-08 01:14:02,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:02,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:14:02,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:14:02,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:14:02,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:02,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986374378] [2025-02-08 01:14:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986374378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:02,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098005170] [2025-02-08 01:14:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:02,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:02,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:02,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 18 transitions, 79 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:02,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:02,680 INFO L124 PetriNetUnfolderBase]: 8/36 cut-off events. [2025-02-08 01:14:02,680 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-02-08 01:14:02,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 36 events. 8/36 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 121. Up to 10 conditions per place. [2025-02-08 01:14:02,681 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 12 selfloop transitions, 5 changer transitions 6/26 dead transitions. [2025-02-08 01:14:02,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 26 transitions, 144 flow [2025-02-08 01:14:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2025-02-08 01:14:02,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-02-08 01:14:02,684 INFO L175 Difference]: Start difference. First operand has 39 places, 18 transitions, 79 flow. Second operand 7 states and 66 transitions. [2025-02-08 01:14:02,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 26 transitions, 144 flow [2025-02-08 01:14:02,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 131 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:02,685 INFO L231 Difference]: Finished difference. Result has 37 places, 16 transitions, 66 flow [2025-02-08 01:14:02,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=16} [2025-02-08 01:14:02,685 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2025-02-08 01:14:02,685 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 16 transitions, 66 flow [2025-02-08 01:14:02,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:02,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:02,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 01:14:02,686 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:14:02,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -15866126, now seen corresponding path program 10 times [2025-02-08 01:14:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:02,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960710762] [2025-02-08 01:14:02,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:02,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-02-08 01:14:02,692 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 16 statements. [2025-02-08 01:14:02,693 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:14:02,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:14:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960710762] [2025-02-08 01:14:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960710762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:14:02,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:14:02,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:14:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739578495] [2025-02-08 01:14:02,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:14:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:14:02,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:14:02,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-02-08 01:14:02,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 16 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-02-08 01:14:02,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:02,818 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-02-08 01:14:02,818 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 01:14:02,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 26 events. 6/26 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 1/26 useless extension candidates. Maximal degree in co-relation 91. Up to 6 conditions per place. [2025-02-08 01:14:02,819 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2025-02-08 01:14:02,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 20 transitions, 109 flow [2025-02-08 01:14:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:14:02,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:14:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2025-02-08 01:14:02,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3630952380952381 [2025-02-08 01:14:02,820 INFO L175 Difference]: Start difference. First operand has 37 places, 16 transitions, 66 flow. Second operand 7 states and 61 transitions. [2025-02-08 01:14:02,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 20 transitions, 109 flow [2025-02-08 01:14:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 20 transitions, 94 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:02,821 INFO L231 Difference]: Finished difference. Result has 32 places, 0 transitions, 0 flow [2025-02-08 01:14:02,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=45, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=32, PETRI_TRANSITIONS=0} [2025-02-08 01:14:02,821 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2025-02-08 01:14:02,821 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 0 transitions, 0 flow [2025-02-08 01:14:02,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:14:02,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-02-08 01:14:02,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-02-08 01:14:02,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-02-08 01:14:02,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 01:14:02,825 INFO L422 BasicCegarLoop]: Path program histogram: [10, 10, 4] [2025-02-08 01:14:02,828 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:14:02,829 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:14:02,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:14:02 BasicIcfg [2025-02-08 01:14:02,833 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:14:02,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:14:02,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:14:02,834 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:14:02,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:55" (3/4) ... [2025-02-08 01:14:02,836 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:14:02,839 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 01:14:02,839 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 01:14:02,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2025-02-08 01:14:02,842 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 01:14:02,843 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 01:14:02,843 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 01:14:02,916 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:14:02,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:14:02,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:14:02,918 INFO L158 Benchmark]: Toolchain (without parser) took 7900.13ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.0MB in the beginning and 222.8MB in the end (delta: -117.8MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2025-02-08 01:14:02,918 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:14:02,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.04ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:14:02,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.73ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:14:02,918 INFO L158 Benchmark]: Boogie Preprocessor took 46.71ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 91.1MB in the end (delta: 872.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:14:02,918 INFO L158 Benchmark]: IcfgBuilder took 540.42ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 56.7MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 01:14:02,919 INFO L158 Benchmark]: TraceAbstraction took 6957.74ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 55.8MB in the beginning and 231.0MB in the end (delta: -175.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-02-08 01:14:02,919 INFO L158 Benchmark]: Witness Printer took 83.11ms. Allocated memory is still 335.5MB. Free memory was 231.0MB in the beginning and 222.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:14:02,920 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.04ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 93.7MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.73ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.71ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 91.1MB in the end (delta: 872.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 540.42ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 56.7MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6957.74ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 55.8MB in the beginning and 231.0MB in the end (delta: -175.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 83.11ms. Allocated memory is still 335.5MB. Free memory was 231.0MB in the beginning and 222.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 37 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3005 IncrementalHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 9 mSDtfsCounter, 3005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=16, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 380 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 2054 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:14:02,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE